Bitwise operations: Difference between revisions

If any operation is not available in your language, note it.

<br><br>

=={{header|11l}}==

{{trans|Kotlin}}

V y = 2

print(‘x = ’x)

print(‘y = ’y)

print(‘x AND y = ’(x [&] y))

print(‘x OR y = ’(x [|] y))

print(‘x SHR y = ’(x >> y))

print(‘x ROL y = ’rotl(x, y))

{{out}}

<pre>

 

=={{header|360 Assembly}}==

BITWISE CSECT

USING BITWISE,R13

PG DS CL12

YREGS

{{out}}

<pre>

</pre>

=={{header|6502 Assembly}}==

 

 

 

 

 

 

 

 

=={{header|8051 Assembly}}==

Integer one is assumed to be a, integer two assumed to be b.

The end result of each operation resides in a.

The shift and rotate operations should likely push psw and pop psw because they affect the carry flag.

anl a, b

 

loop:

rr a

 

=={{header|ABAP}}==

This works in ABAP 7.40 and above. The missing arithmetic shift operations have been implemented with arithmetic, whereas the logical shift and the rotate operations have been implemented using the built in string functions shift_left and shift_right.

 

report z_bitwise_operations.

 

new_value = result ).

write: |a rotr b -> { result }, { hex_converter=>to_binary( result ) }, { hex_converter=>to_decimal( result ) }|, /.

 

{{output}}

a rotr b -> C000003F, 11000000000000000000000000111111, -1073741761

</pre>

=={{header|ACL2}}==

Unlisted operations are not available

(list (logand a b)

(logior a b)

(lognot a)

(ash a b)

 

=={{header|ActionScript}}==

ActionScript does not support bitwise rotations.

{

trace("And: ", a & b);

trace("Right Shift(Arithmetic): ", a >> b);

trace("Right Shift(Logical): ", a >>> b);

=={{header|Ada}}==

The following program performs all required operations and prints the resulting values in base 2 for easy checking of the bit values.

 

use Ada.Text_IO, Interfaces;

 

Put_Line (Unsigned_8'Image (Rotate_Left (X, N)));

Put_Line (Unsigned_8'Image (Rotate_Right (X, N)));

=={{header|Aikido}}==

{{trans|Javascript}}

 

There is no rotate support built in to Aikido.

println("a AND b: " + (a & b))

println("a OR b: "+ (a | b))

println("a >> b: " + (a >> b)) // arithmetic right shift

println("a >>> b: " + (a >>> b)) // logical right shift

=={{header|ALGOL 68}}==

{{works with|ALGOL 68|Standard - no extensions to language used}}

* 2r00000000000000000000000010101010, 4r0000000000002222, 8r00000000252, 16r000000aa

* and as an array of BOOL: FFFFFFFFFFFFFFFFFFFFFFFFTFTFTFTF

 

PRIO SLC = 8, SRC = 8; # SLC and SRC are not built in, define and overload them here #

bitwise(16rff,16raa,5)

END CO

Output:

<pre> bits shorths: +1 1 plus the number of extra SHORT BITS types

</pre>

Note that an INT can be widened into BITS, and BITS can be widened into an array of BOOL. eg:

INT i := 170;

BITS j := BIN i;

i := ABS j;

 

Output:

<pre>

+85, 8r0125, FTFTFTFT

</pre>

=={{header|ALGOL W}}==

% Algol W does not have xor, arithmetic right shift, left rotate or right rotate %

procedure bitOperations ( integer value n1, n2 ) ;

write( n1, " shl ", n2, " = ", number( b1 shl n2 ), " ( left-shift )" );

write( n1, " shr ", n2, " = ", number( b1 shr n2 ), " ( right-shift )" )

=={{header|AppleScript}}==

Applescript has no bitwise operators. It's probably not the right tool to reach for if you need to work with bits.

 

 

use framework "Foundation"

use scripting additions

return lst

end tell

{{Out}}

<pre>32 bit signed integers (in two's complement binary encoding)

 

'''Second option''' – writing our own bitwise functions for Applescript:

use framework "Foundation"

use scripting additions

return lst

end tell

{{Out}}

<pre>32 bit signed integers (in two's complement binary encoding)

A '''third option''' is the mathematical one, although it still involves looping through the hypothetical bits where two numbers are involved, unless I've missed a trick. The handlers below all assume positive number inputs (except for ''arithmeticRightShift()'') and attempt to return results of class integer. The "hi bits" of numbers which don't fit the specified register sizes are discarded.

 

set out to 0

-- Multiplying equivalent bit values by each other gives 1 where they're both 1 and 0 otherwise.

leftRotate(92, 7, 8) --> 46

rightRotate(92, 7, 8) --> 184

=={{header|ARM Assembly}}==

{{works with|as|Raspberry Pi}}

 

/* ARM assembly Raspberry PI */

 

=={{header|Arturo}}==

b: 2

 

print ["NOT" a "=" not a]

print [a "SHL" b "=" shl a b]

{{out}}

255 SHL 2 = 1020

255 SHR 2 = 63 </pre>

=={{header|AutoHotkey}}==

bitwise(a, b)

{

MsgBox % "a << b: " . a << b ; left shift

MsgBox % "a >> b: " . a >> b ; arithmetic right shift

=={{header|AutoIt}}==

No arithmetic shift.

Func bitwise($a, $b)

MsgBox(1, '', _

$a & " ROL " & $b & ": " & BitRotate($a, $b) & @CRLF & _

$a & " ROR " & $b & ": " & BitRotate($a, $b * -1) & @CRLF )

{{out}}

255 ROL 5: 8160

255 ROR 5: 63495</pre>

=={{header|AWK}}==

Standard awk does not have bitwise operators. Gawk has built-in functions for many bitwise operations. No rotation of bits.

{{works with|gawk}}

 

n = 11

p = 1

print n " >> " p " = " rshift(n, p) # right shift

printf "not %d = 0x%x\n", n, compl(n) # bitwise complement

 

[[OpenBSD]] <code>/usr/bin/awk</code> (a variant of [[nawk]]) has these same functions, with a few differences. Gawk uses 53-bit unsigned integers, but OpenBSD awk uses 32-bit signed integers. Therefore Gawk prints <code>not 11 = 0x1ffffffffffff4</code>, but OpenBSD awk prints <code>not 11 = 0xfffffff4</code>.

=={{header|Axe}}==

r₁→A

r₂→B

Disp "NOT:",not(A)ʳ▶Dec,i

.No language support for shifts or rotations

 

Note that the symbols for AND, OR, and XOR are the stat plot marks near the bottom of the Catalog.

=={{header|Babel}}==

 

In Babel, we prefix the logic operators with a 'c' to denote that they are C-style operations, that is, they are word-width operations, not arbitrary size operations. The following program combines the numbers 5 and 9 using the various bitwise operators and then displays the results.

 

 

{{Out}}

The cnot operator works on just one operand:

 

 

{{Out}}

<pre>[val 0xfffffff6 ]</pre>

=={{header|BASIC}}==

{{works with|QuickBasic|4.5}}

QuickBasic does not have shift or rotate operations defined. Here are the logical operations:

PRINT a AND b

PRINT a OR b

PRINT a XOR b

PRINT NOT a

 

{{works with|FreeBASIC}}

FreeBASIC does not have rotate operators. Shift Right operator performs arithmetic shift if the left value is signed number and logical shift if the left value is unsigned number.

DIM u AS UInteger

 

u = a

PRINT "a SHR b (logical) = "; u SHR b

 

==={{header|Commodore BASIC}}===

Commodore BASIC V2.0 does not have '''XOR''', '''left shift''', '''right shift''', '''right arithmetic shift''', '''left rotate''', and '''right rotate''' operators. In this implementation the '''XOR''' operation is done with an equivalent formula.

 

20 INPUT "B="; B

30 PRINT "A AND B =" A AND B :rem AND

40 PRINT "A OR B =" A OR B :rem OR

50 PRINT "A XOR B =" (A AND(NOT B))OR((NOT A)AND B) :rem XOR

{{in}}

<pre>A=? 2

 

==={{header|IS-BASIC}}===

110 PRINT A;"and";B;"=";A AND B

120 PRINT A;"band";B;"=";A BAND B

150 PRINT A;"xor";B;"=";XOR(A,B)

160 PRINT " not";A;"=";NOT A

 

==={{header|Sinclair ZX81 BASIC}}===

 

The disassembly of the Z80 code would be:

3a 83 40 ld a, (4083)

47 ld b, a

06 00 ld b, 0

4f ld c, a ; value in BC reg pair is returned to BASIC

We then use <code>POKE</code> statements to replace the <code>and</code> instruction with each successive operation we want to perform.

 

Finally, observe that the first line reserves 15 bytes for our machine code routine by hiding them in a comment.

 

20 INPUT A

30 INPUT B

230 POKE 16514,USR 16516

240 NEXT I

{{in}}

<pre>21

Tiny BASIC has only one data type- the signed 16-bit integer- and no bitwise operations. This code emulates bitwise operations on unsigned 15-bit integers. Since the logic gates AND, NOR, and NXOR are characterised by having exactly two, exactly zero, and exactly one on bit in their inputs, their code is identical except for having a different number of target on bits (line 500 onward). The OR and XOR gates are just NOT NOR and NOT NXOR. The shift and rotate operations are simple divisions and mutiplications by 2, with care taken to avoid overflow, and a carry flag where applicable.

 

REM VARIABLES

REM A = first number

IF P = 0 THEN RETURN

GOTO 500

 

=={{header|BASIC256}}==

a = 0b00010001

b = 0b11110000

print a \ 2 # shift right (integer divide by 2)

print a | b # bitwise or on two integer values

=={{header|Batch File}}==

The SET command with the /A option supports arithmetic and bit operations on signed 8 byte integers.

 

The following script (bitops.bat) not only demonstrates the basic bit operations, it also uses bit operations to convert each integral value into a string of 32 binary digits.

@echo off

setlocal

)

exit /b

 

Sample output

11111101000000000000000000000001

</pre>

=={{header|BBC BASIC}}==

number2% = 8

PRINT ~ number1% >> number2% : REM right shift (arithmetic)

PRINT ~ (number1% << number2%) OR (number1% >>> (32-number2%)) : REM left rotate

=={{header|beeswax}}==

###>N{` AND `~{~` = `&{Nz1~3J

UXe#

###

>UX`-`!P{M!` >> `~{~` = `!)!`-`M!{` , interpreted as (negative) signed Int64 number (MSB=1)`NN;

 

Example:

julia> beeswax("Bitops.bswx",0,0.0,Int(20000))

i9223653511831486512

logical shift right, and negating the result again:

 

 

The natural number range for beeswax is unsigned Int64, but it is easy to implement signed Int64 by realizing negative numbers by their 2’s complements or interpreting numbers as negative if their MSB is 1, as shown in the example above.

 

Arithmetic shift right is not originally implemented in beeswax because it does not make sense for unsigned integers, but for negative numbers, it can be realized easily with

as demonstrated above.

 

In beeswax, rotate left (ROL) and rotate right (ROT) operators are implemented using modulo 64, so rotations by more than 63 bits wrap around:

 

=={{header|Befunge}}==

1 2 3 4 5 6>61g-:| 8 9

>&&\481p >88*61p371p >:61g\`!:68*+71g81gp| 7 >61g2/61p71g1+71pv

^ < G

 

The labelled points (1 to G) are:

1. Read in A and B,

1 22 23 106 42 10

</pre>

=={{header|C}}==

{

printf("a and b: %d\n", a & b);

/* there are no rotation operators in C */

return 0;

 

To rotate an integer, you can combine a left shift and a right shift:

unsigned int rotr(unsigned int x, unsigned int s)

{

return (x >> s) | (x << 32 - s);

movl 4(%esp), %eax ; arg1: x

movl 8(%esp), %ecx ; arg2: s

rorl %cl, %eax ; right rotate x by s

=={{header|C sharp|C#}}==

{

Console.WriteLine("a and b is {0}", a & b);

// the operator performs a logical shift right

// there are no rotation operators in C#

=={{header|C++}}==

{{trans|C}}

 

void bitwise(int a, int b)

std::cout << "a xor b: " << (a ^ b) << '\n';

std::cout << "not a: " << ~a << '\n';

std::cout << "a shl b: " << (a << b) << '\n'; // Note: "<<" is used both for output and for left shift

std::cout << "a shr b: " << (a >> b) << '\n'; // typically arithmetic right shift, but not guaranteed

 

=={{header|Clojure}}==

(bit-or x y)

(bit-xor x y)

(bit-shift-left x n)

(bit-shift-right x n)

=={{header|COBOL}}==

PROGRAM-ID. bitwise-ops.

 

01 a PIC 1(32) USAGE BIT.

01 b PIC 1(32) USAGE BIT.

01 result PIC 1(32) USAGE BIT.

LINKAGE SECTION.

01 a-int USAGE BINARY-LONG.

DISPLAY "a exclusive-or b is " result-disp

 

 

 

{{works with|Visual COBOL}}

PROGRAM-ID. mf-bitwise-ops.

DATA DIVISION.

LOCAL-STORAGE SECTION.

01 result USAGE BINARY-LONG.

78 arg-len VALUE LENGTH OF result.

LINKAGE SECTION.

01 a USAGE BINARY-LONG.

01 b USAGE BINARY-LONG.

PROCEDURE DIVISION USING a, b.

main-line.

CALL "CBL_AND" USING a, result, VALUE arg-len

DISPLAY "a and b is " result

MOVE b TO result

CALL "CBL_OR" USING a, result, VALUE arg-len

DISPLAY "a or b is " result

MOVE a TO result

CALL "CBL_NOT" USING result, VALUE arg-len

DISPLAY "Not a is " result

MOVE b TO result

CALL "CBL_XOR" USING a, result, VALUE arg-len

DISPLAY "a exclusive-or b is " result

MOVE b TO result

CALL "CBL_EQ" USING a, result, VALUE arg-len

DISPLAY "Logical equivalence of a and b is " result

MOVE b TO result

CALL "CBL_IMP" USING a, result, VALUE arg-len

DISPLAY "Logical implication of a and b is " result

 

 

=={{header|CoffeeScript}}==

CoffeeScript provides sugar for some JavaScript operators, but the bitwise operators are taken directly from JS. See more here: http://coffeescript.org/#operators

 

f = (a, b) ->

p "and", a & b

 

f(10,2)

 

output

> coffee foo.coffee

and 2

<< 40

>> 2

=={{header|Common Lisp}}==

(print (logand a b)) ; AND

(print (logior a b)) ; OR ("ior" = inclusive or)

(print (ash a (- b))) ; arithmetic right shift (negative 2nd arg)

; no logical shift

 

Left and right logical shift may be implemented by the following functions:

 

(defun shl (x width bits)

"Compute bitwise left shift of x by 'bits' bits, represented on 'width' bits"

(logand (ash x (- bits))

(1- (ash 1 width))))

 

Left and right rotation may be implemented by the following functions:

 

(defun rotl (x width bits)

"Compute bitwise left rotation of x by 'bits' bits, represented on 'width' bits"

(logand (ash x (- width (mod bits width)))

(1- (ash 1 width)))))

=={{header|D}}==

return (x >>> shift) | (x << (T.sizeof * 8 - shift));

}

 

testBit(a, b);

{{out}}

<pre>Input: a = 255, b = 2

 

Compilers are usually able to optimize the code pattern of the rot function to one CPU instruction plus loads. The DMD compiler too performs such optimization.

=={{header|Delphi}}==

 

{$APPTYPE CONSOLE}

// there are no built-in rotation operators in Delphi

Readln;

=={{header|DWScript}}==

PrintLn('2 or 3 = '+IntToStr(2 or 3));

PrintLn('2 xor 3 = '+IntToStr(2 xor 3));

PrintLn('not 2 = '+IntToStr(not 2));

PrintLn('2 shl 3 = '+IntToStr(2 shl 3));

=={{header|E}}==

E provides arbitrary-size integers, so there is no distinct arithmetic and logical shift right. E does not provide bit rotate operations.

 

println(`Bitwise operations:

a AND b: ${a & b}

a right shift b: ${a >> b}

`)

 

=={{header|ECL}}==

BitwiseOperations(INTEGER A, INTEGER B) := FUNCTION

BitAND := A & B;

*/

 

=={{header|Elena}}==

 

extension testOp

bitwiseTest(y)

{

console.printLine(self," shr ",y," = ",self.shiftRight(y));

console.printLine(self," shl ",y," = ",self.shiftLeft(y));

{

console.loadLineTo(new Integer()).bitwiseTest(console.loadLineTo(new Integer()))

{{out}}

<pre>

 

=={{header|Elixir}}==

use Bitwise

end

 

 

{{out}}

255 >>> 2 = 63

</pre>

=={{header|Erlang}}==

All these operations are built-in functions except right arithmetic shift, left rotate, and right rotate.

 

-module(bitwise_operations).

 

io:format("~p bsl ~p = ~p\n",[A,B,A bsl B]),

io:format("~p bsr ~p = ~p\n",[A,B,A bsr B]).

 

outputs:

255 band 170 = 170

255 bor 170 = 255

255 bsl 170 = 381627307539845370001346183518875822092557105621893120

255 bsr 170 = 0

=={{header|F_Sharp|F#}}==

printfn "a and b: %d" (a &&& b)

printfn "a or b: %d" (a ||| b)

printfn "a shr b: %d" (a >>> b) // arithmetic shift

printfn "a shr b: %d" ((uint32 a) >>> b) // logical shift

=={{header|Factor}}==

{

[ bitand "a AND b: " write . ]

[ abs shift "a asl b: " write . ]

[ neg shift "a asr b: " write . ]

 

outputs:

b=5

a AND b: 5

NOT a: -256

a asl b: 8160

Currently rotation and logical shifts are not implemented.

=={{header|FALSE}}==

Only AND, OR, and NOT are available.

\$@$@$@$@\ { 3 copies }

"a & b = "&."

a | b = "|."

~a = "%~."

=={{header|Forth}}==

: bitwise ( a b -- )

cr ." a = " over . ." b = " dup .

cr ." a shr b = " 2dup rshift .

cr ." a ashr b = " 2dup arshift .

Rotation is not standard, but may be provided in particular Forth implementations, or as an assembly instruction in CODE words.

=={{header|Fortran}}==

In ISO Fortran 90 and later the following BIT INTRINSIC functions are defined:

logical :: a

! returns them as the rightmost bits of an otherwise

! zero-filled integer. For non-negative K this is

The following INTRINSIC ELEMENTAL SUBROUTINE is also defined:

 

program bits_rosetta

implicit none

 

end program bits_rosetta

Output

Input a= 14 b= 3

AND : 00000000000000000000000000001110 & 00000000000000000000000000000011 = 00000000000000000000000000000010 2

NOT : 00000000000000000000000000001110 ~ 00000000000000000000000000000011 = 11111111111111111111111111110001 -15

ROT : 00000000000000000000000000001110 ~ 00000000000000000000000000000011 = 11000000000000000000000000000001 -1073741823

=={{header|Free Pascal}}==

{$mode objfpc}

var

writeln('2 sar 3 = ', sarshortint(x,y));

Readln;

=={{header|FreeBASIC}}==

' FB 1.05.0 Win64 (Note the (U)Integer type is 64 bits)

 

Print

Print "Press any key to quit"

 

{{out}}

x ROR y = 4611686018427387902

</pre>

=={{header|FutureBasic}}==

FB does not have a bitwise symbol for not, but rather uses the "not" expression. It does not support predefined bitwise symbols for rotate left and rotate right, but functions in this demo provide that capability.

 

 

local fn bitwise( a as long, b as long )

end fn

fn bitwise( 255, 2 )

 

Output:

Rotate right : fn rotr( a, b ) = 11000000000000000000000000111111 : -1073741761

</pre>

=={{header|Go}}==

 

import "fmt"

var a, b int16 = -460, 6

bitwise(a, b)

Output:

<pre>a: 1111111000110100

rol: 1000110100111111

ror: 1101001111111000</pre>

=={{header|Groovy}}==

println """

a & b = ${a} & ${b} = ${a & b}

a >>> b = ${a} >>> ${b} = ${a >>> b} logical (zero-filling) shift

"""

 

Program:

 

Output:

a >> b = -15 >> 3 = -2 arithmetic (sign-preserving) shift

a >>> b = -15 >>> 3 = 536870910 logical (zero-filling) shift</pre>

=={{header|Harbour}}==

Harbour language has a set of core functions, which are fully optimized

at compile time, to perform bitwise operations.

PROCEDURE Main(...)

local n1 := 42, n2 := 2

return

 

Output:

Bitwise operations with two integers

Rotate left --> 168

Rotate right --> -2147483638

=={{header|Haskell}}==

 

The operations in ''Data.Bits'' work on ''Int'', ''Integer'', and any of the sized integer and word types.

 

bitwise :: Int -> Int -> IO ()

 

main :: IO ()

{{Out}}

<pre>170

print $ shiftL (-1 :: Word) 1

print $ shiftR (-1 :: Word) 1

=={{header|HicEst}}==

There is no rotate and no shift support built in to HicEst

i = IOR( k, j)

i = IEOR(k, j)

=={{header|HPPPL}}==

BEGIN

PRINT(BITAND(a, b));

PRINT(BITSR(a, b));

// HPPPL has no builtin rotates or arithmetic right shift.

=={{header|Icon}} and {{header|Unicon}}==

bitdemo(255,2)

bitdemo(-15,3)

procedure demowrite(vs,v)

return write(vs, ": ", v, " = ", int2bit(v),"b")

 

Icon/Unicon implements bitwise operations on integers. Because integers can be transparently large integers operations that require fixed sizes don't make sense and aren't defined. These include rotation and logical shifting (shift is arithmetic) . Please note also that 'not' is a reserved word and the negation function is 'icom'

i shift 3: -120 = -1111000b

i shift -3: -2 = -10b</pre>

=={{header|Inform 6}}==

Inform 6 has no xor or rotate operators. It also has no shift operators, although the Z-machine, its usual target architecture, does. These can be accessed with inline assembly, which is done here.

 

print "a and b: ", a & b, "^";

print "a or b: ", a | b, "^";

print "a >> b (logical): ", temp, "^";

];

=={{header|J}}==

 

Here are the "[http://www.jsoftware.com/help/dictionary/dbdotn.htm bitwise operators]":

 

bOR=: 23 b. NB. 16+#.0 1 1 1

bXOR=: 22 b. NB. 16+#.0 1 1 0

bRAshift=: 34 b.~ -

bLrot=: 32 b.~

 

And here is a routine which takes a list of bitwise operators and two numbers and displays a table of results from combining those two numbers with each of the operators:

 

:

smoutput (((":x),"1' ',.(>u),.' '),"1":y),"1' => ',"1'.X'{~#:x u`:0 y

 

And here they are in action:

 

254 bAND 3 => ............................X.

254 bOR 3 => ......................XXXXXXXX

254 bRAshift 3 => .........................XXXXX

254 bLrot 3 => ...................XXXXXXX....

 

Further test

bXOR/ 3333 5555 7777 9999

8664

=={{header|Java}}==

System.out.println("a AND b: " + (a & b));

System.out.println("a OR b: "+ (a | b));

System.out.println("a rol b: " + Integer.rotateLeft(a, b)); //rotate left, Java 1.5+

System.out.println("a ror b: " + Integer.rotateRight(a, b)); //rotate right, Java 1.5+

All of the operators may be combined with the <tt>=</tt> operator to save space. For example, the following lines each do the same thing:

a = a << 3;

a *= 8; //2 * 2 * 2 = 8

=={{header|JavaScript}}==

There are no integers in Javascript, but there are still bitwise operators. They will convert their number operands into integers before performing they task. In other languages, these operators are very close to the hardware and very fast. In JavaScript, they are very far from the hardware and very slow and rarely used.

 

alert("a AND b: " + (a & b));

alert("a OR b: "+ (a | b));

alert("a >> b: " + (a >> b)); // arithmetic right shift

alert("a >>> b: " + (a >>> b)); // logical right shift

 

=={{header|Julia}}==

@show 1 & 2 # AND

@show 1 | 2 # OR

@show A ror(A,1) ror(A,2) ror(A,5) # ROTATION RIGHT

@show rol(A,1) rol(A,2) rol(A,5) # ROTATION LEFT

 

{{out}}

 

=={{header|Kotlin}}==

val x = 10

val y = 2

println("x AND y = ${x and y}")

println("x XOR y = ${x xor y}")

println("x SHL y = ${x shl y}")

 

{{out}}

<pre>

x AND y = 2

x XOR y = 8

x SHL y = 40

 

All these operations are built-in functions except right arithmetic shift, left rotate, and right rotate.

(lists:map

(lambda (x) (io:format "~p~n" `(,x)))

(describe "bsl" a b (bsl a b))

(describe "bsr" a b (bsr a b))))

 

Example usage:

> (bitwise 255 170)

170

ok

>

=={{header|Liberty BASIC}}==

Written as functions.

' bitwise operations on byte-sized variables

 

dec2Bin$ =right$( "00000000" +dec2Bin$, 8)

end function

=={{header|Lingo}}==

Lingo has built-in functions for bitwise AND, OR, XOR and NOT:

put bitOR(2,7)

put bitXOR(2,7)

Bit shifting and rotating has to be implemented by custom functions.

=={{header|LiveCode}}==

put " or:" && (255 bitor 2) & comma after bitops

put " xor:" && (255 bitxor 2) & comma after bitops

 

-- Ouput

LiveCode does not provide built-in bit-shift operations.

=={{header|LLVM}}==

;e means little endian

;p: { pointer size : pointer abi : preferred alignment for pointers }

 

;Declare external fuctions

=={{header|Logo}}==

{{works with|UCB Logo}}

(print [a and b:] BitAnd :a :b)

(print [a or b:] BitOr :a :b)

(print [-a ashift -b:] AShift minus :a minus :b)

end

The output of this program is:

a or b: 255

a xor b: 250

a lshift b: 8160

a lshift -b: 7

=={{header|LSE64}}==

{{incorrect|LSE64|No reason given.}}

2dup : over over

" not A=" ,t ~ ,h nl

=={{header|Lua}}==

 

LuaBitOp implements bitwise functionality for Lua:

 

 

local vb = {

assert(bit.bxor(1,2) == 3)

assert(bit.bor(1,2,4,8,16,32,64,128) == 255)

 

The ''RiscLua'' dialect, for [http://lua.riscos.org.uk/ '''RISC OS'''], has

==={{header|Lua 5.3+}}===

As of Lua 5.3 most of the required operations are built-in, and those still missing could be derived from them:

b = 0x4

print(string.format("%8X and %8X = %16X", a, b, a&b))

print(string.format("%8X sar %8X = %16X", a, b, sar(a,b)))

print(string.format("%8X rol %8X = %16X", a, b, rol(a,b)))

{{out}}

<pre>AA55AA55 and 4 = 4

AA55AA55 rol 4 = A55AA55A

AA55AA55 ror 4 = 5AA55AA5</pre>

=={{header|Maple}}==

with(Bits):

bit:=proc(A,B)

return a,b,c,d,e,f,g,i;

end proc;

=={{header|Mathematica}}/ {{header|Wolfram Language}}==

Most functions are built-in or can be made really easily:

BitAnd[integer1, integer2]

BitXor[integer1, integer2]

 

(*right arithmetic shift*)

The function BitShiftLeft, BitShiftRight, RotateRight, RotateLeft all take a second argument, which is the displacement, by default it is set to 1. BitAnd, BitXor and BitOr can handle more than 2 arguments:

gives back:

=={{header|MATLAB}} / {{header|Octave}}==

Newer versions of MATLAB have even more bitwise operations than those demonstrated here. A complete list of bitwise operations for the newest version of MATLAB can be found at [http://www.mathworks.com/help/toolbox/fixedpoint/ref/f20333.html#bp7caxc-42 MathWorks]

 

 

disp(sprintf('%d and %d = %d', [a b bitand(a,b)]));

disp(sprintf('%d >> %d = %d', [a b bitshift(a,-b)]));

 

 

Output:

255 and 2 = 2

255 or 2 = 255

255 xor 2 = 253

255 << 2 = 1020

=={{header|Maxima}}==

 

a: 3661$

 

logand(a, -a - 1);

=={{header|MAXScript}}==

(

format "a and b: %\n" (bit.and a b)

)

 

 

MAXScript doesn't have arithmetic shift or rotate operations.

=={{header|ML/I}}==

ML/I only supports bitwise AND and OR operations. These are available from version CKD onwards.

 

"" Bitwise operations

"" assumes macros on input stream 1, terminal on stream 2

MCSET S1=1

*MCSET S10=2

=={{header|Modula-3}}==

 

 

IMPORT IO, Fmt, Word;

BEGIN

Bitwise(255, 5);

 

Output:

c RightRotate b: f8000007

</pre>

=={{header|Neko}}==

<doc>

<h2>bitwise operations</h2>

if b == null b = 0;

 

 

{{out}}

a ROL b: is not directly supported in Neko syntax

a ROR b: is not directly supported in Neko syntax</pre>

=={{header|Nemerle}}==

def j = 2;

 

WriteLine($"$(i :> uint) rshift $j is $(c >> j)"); // When the left operand of the >> operator is of an unsigned integral type,

// the operator performs a logical shift right

=={{header|Nim}}==

echo "a and b: " , a and b

echo "a or b: ", a or b

echo "not a: ", not a

echo "a << b: ", a shl b

=={{header|NSIS}}==

All bitwise operations in NSIS are handled by the [http://nsis.sourceforge.net/Docs/Chapter4.html#4.9.10.2 IntOp] instruction.

Push $0

Push $1

Pop $1

Pop $0

=={{header|Oberon-2}}==

{{Works with|oo2c version 2}}

MODULE Bitwise;

IMPORT

Do(10,2);

END Bitwise.

{{out}}

<pre>

a arithmetic right shift b :> 2

</pre>

=={{header|Objeck}}==

 

bundle Default {

}

}

=={{header|OCaml}}==

Printf.printf "a and b: %d\n" (a land b);

Printf.printf "a or b: %d\n" (a lor b);

Printf.printf "a asr b: %d\n" (a asr b); (* arithmetic right shift *)

Printf.printf "a lsr b: %d\n" (a lsr b); (* logical right shift *)

=={{header|Octave}}==

 

There's no arithmetic shift nor rotation (and the not can be done through a xor)

 

s = sprintf("%s %%s %s = %%s\n", dec2bin(a), dec2bin(b));

printf(s, "or", dec2bin(bitor(a, b)));

endfunction

 

=={{header|Oforth}}==

 

There is no built-in for not and rotation

 

a b bitAnd println

a b bitOr println

a b bitXor println

a bitLeft(b) println

=={{header|ooRexx}}==

/ Bit Operations work as in Rexx (of course)

* Bit operations are performed up to the length of the shorter string.

Say 'a~bitor(b,p):'c2b(a~bitor(b,p)) c2x(a~bitor(b,p))

Exit

Output:

<pre>

a~bitor(b,p):001100110011010111111111 3335FF

</pre>

=={{header|OpenEdge/Progress}}==

 

The only bit operators available in OpenEdge are the GET-BITS() and PUT-BITS() functions. These functions can be used to implement all bitwise operators.

=={{header|PARI/GP}}==

Pari does not support bitwise rotations, which have no obvious meaning with arbitrary-precision integers. See also <code>bitnegimply</code> for another bitwise operator. For shifts, see also <code>shiftmul</code>.

print("And: "bitand(a,b));

print("Or: "bitor(a,b));

print("Left shift: ",a<<b);

print("Right shift: ",a>>b);

=={{header|Pascal}}==

While Standard Pascal does not have bitwise operations, most Pascal implementations (including Turbo Pascal and Delphi) extend the standard logical operators to also provide bitwise operations:

a, b: integer;

begin

writeln('a or b = ', a or b); { 14 = 1110 }

writeln('a xor b = ', a xor b) { 6 = 0110 }

=={{header|Perl}}==

($a, $b) = @_;

print 'a and b: '. ($a & $b) ."\n";

print 'a << b: ', $a << $b, "\n"; # left shift

print 'a >> b: ', $a >> $b, "\n"; # arithmetic right shift

 

=={{header|Phix}}==

<span style="color: #008080;">enum</span> <span style="color: #000000;">SHL</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">SAR</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">SHR</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">ROL</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">ROR</span>

<span style="color: #008080;">function</span> <span style="color: #000000;">bitop</span><span style="color: #0000FF;">(</span><span style="color: #004080;">atom</span> <span style="color: #000000;">a</span><span style="color: #0000FF;">,</span> <span style="color: #004080;">integer</span> <span style="color: #000000;">b</span><span style="color: #0000FF;">,</span> <span style="color: #004080;">integer</span> <span style="color: #000000;">op</span><span style="color: #0000FF;">)</span>

<span style="color: #008080;">return</span> <span style="color: #000000;">res</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">function</span>

<span style="color: #008080;">procedure</span> <span style="color: #000000;">bitwise</span><span style="color: #0000FF;">(</span><span style="color: #004080;">atom</span> <span style="color: #000000;">a</span><span style="color: #0000FF;">,</span> <span style="color: #004080;">atom</span> <span style="color: #000000;">b</span><span style="color: #0000FF;">)</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">" shl(%b,%b) = %032b\n"</span><span style="color: #0000FF;">,{</span><span style="color: #000000;">a</span><span style="color: #0000FF;">,</span><span style="color: #000000;">b</span><span style="color: #0000FF;">,</span><span style="color: #000000;">bitop</span><span style="color: #0000FF;">(</span><span style="color: #000000;">a</span><span style="color: #0000FF;">,</span><span style="color: #000000;">b</span><span style="color: #0000FF;">,</span><span style="color: #000000;">SHL</span><span style="color: #0000FF;">)})</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">" sar(%b,%b) = %032b\n"</span><span style="color: #0000FF;">,{</span><span style="color: #000000;">a</span><span style="color: #0000FF;">,</span><span style="color: #000000;">b</span><span style="color: #0000FF;">,</span><span style="color: #000000;">bitop</span><span style="color: #0000FF;">(</span><span style="color: #000000;">a</span><span style="color: #0000FF;">,</span><span style="color: #000000;">b</span><span style="color: #0000FF;">,</span><span style="color: #000000;">SAR</span><span style="color: #0000FF;">)})</span>

<span style="color: #000000;">bitwise</span><span style="color: #0000FF;">(</span><span style="color: #000000;">0x800000FE</span><span style="color: #0000FF;">,</span><span style="color: #000000;">7</span><span style="color: #0000FF;">)</span>

{{out}}

<pre>

ror(10000000000000000000000011111110,111) = 11111101000000000000000000000001

</pre>

=={{header|Phixmonti}}==

 

def tab

"OR = " print tab a b bitor printBits

"XOR = " print tab a b bitxor printBits

=={{header|PHP}}==

{

function zerofill($a,$b) {

echo '$a >> $b: ' . $a >> $b . '\n'; // arithmetic right shift

echo 'zerofill($a, $b): ' . zerofill($a, $b) . '\n'; // logical right shift

=={{header|PicoLisp}}==

PicoLisp has no specific word size. Numbers grow to arbitrary length. Therefore,

 

Bitwise AND:

-> 2

 

: (& 7 3 1)

Bitwise AND-Test (tests if all bits in the first argument are set in the

following arguments):

-> NIL

 

 

: (bit? 6 15 255)

Bitwise OR:

-> 3

 

: (| 1 2 4 8)

Bitwise XOR:

-> 5

 

: (x| 2 7 1)

Shift (right with a positive count, left with a negative count):

-> 4

 

 

: (>> -1 -16)

=={{header|Pike}}==

Rotate operations are not available

void bitwise(int a, int b)

{

bitwise(255, 30);

}

{{Out}}

<pre>

a << b & 0xffffffff (32bit cap): 0xc0000000

</pre>

=={{header|PL/I}}==

k = iand(i,j);

k = ior(i,j);

u = substr(s, length(s), 1) || substr(s, 1, length(s)-1); /* implements rotate right. */

u = substr(s, 2) || substr(s, 1, 1); /* implements rotate left. */

=={{header|Pop11}}==

 

printf(a && b, 'a and b = %p\n');

printf(a || b, 'a or b = %p\n');

printf(a << b, 'left shift of a by b = %p\n');

printf(a >> b, 'arithmetic right shift of a by b = %p\n');

 

Conceptually in Pop11 integers have infinite precision, in particular negative numbers conceptually have infinitely many leading 1's in two's complement notation. Hence, logical right shift is not defined. If needed, logical right shift can be simulated by masking high order bits.

 

Similarly, on infinitely precise numbers rotation is undefined.

=={{header|PowerShell}}==

Logical right shift and rotations are not supported in PowerShell.

{{works with|PowerShell|2.0}}

$X -bor $Y

$X -bxor $Y

{{works with|PowerShell|3.0}}

# Arithmetic right shift

$X -shr $Y

 

# Requires quite a stretch of the imagination to call this "native" support of right rotate, but it works

=={{header|PureBasic}}==

Debug a & b ; And

Debug a | b ;Or

!mov dword [p.v_Temp], edx

Debug Temp

=={{header|Python}}==

===Python 3===

binary output formatting in calculations and result displays.

 

mask = (1 << width) - 1

print(f"""\

if __name__ == '__main__':

bitwise_built_ins(8, 27, 125)

 

{{out}}

 

===Python 2===

print 'a and b:', a & b

print 'a or b:', a | b

print 'not a:', ~a

print 'a << b:', a << b # left shift

 

Python does not have built in rotate or logical right shift operations.

Note: Newer Python versions (circa 2.4?) will automatically promote integers into "long integers" (arbitrary length, bounded by available memory). This can be noticed especially when using left shift operations. When using bitwise operations one usually wants to keep these bounded to specific sizes such as 8, 16, 32 or 64 bit widths. To do these we use the AND operator with specific values (bitmasks). For example:

 

x = x << n & 0xff

# ditto for 16 bit:

x = x << n & 0xffffffff

# ... and 64-bit:

 

We can easily implement our own rotation functions. For left rotations this is down by ORing the left shifted and masked lower bits against the right shifted upper bits. For right rotations we perform the converse operations, ORing a set of right shifted lower bits against the appropriate number of left shifted upper bits.

 

"""return the binary representation of n as a string and

optionally zero-fill (pad) it to a given length

return n

n &= mask(width)

 

In this example we show a relatively straightforward function for converting integers into strings of bits, and another simple ''mask()'' function to create arbitrary lengths of bits against which we perform our masking operations. Also note that the implementation of these functions defaults to single bit rotations of 8-bit bytes. Additional arguments can be used to over-ride these defaults. Any case where the number of rotations modulo the width is zero represents a rotation of all bits back to their starting positions. This implementation should handle any integer number of rotations over bitfields of any valid (positive integer) length.

 

=={{header|Quackery}}==

 

Integers in Quackery are bignums, so the bitwise left rotate word <code>rot64</code> rotates specifically the least significant 64 bits of an integer. There is no corresponding bitwise right rotate, but it is readily defined from <code>rot64</code>.

 

64 times

[ 2 /mod

say "bitwise RROTATE: " rrot64 echobin ] is task ( n n --> )

 

 

{{out}}

bitwise RROTATE: 1111111111111110000000000000000000000000000000000000000000011111

</pre>

=={{header|R}}==

 

=== Native functions in R 3.x ===

 

a <- 35

bitwNot(a)

bitwShiftL(a, 2)

 

 

===Using ''as.hexmode'' or ''as.octmode''===

b <- as.hexmode(42)

as.integer(a & b) # 34

as.integer(a | b) # 43

 

===Using ''intToBits''===

The logical operators in R, namely &, | and !, are designed to work on logical vectors rather than bits. It is possible to convert from integer to logical vector and back to make these work as required, e.g.

logicalBitsToInt <- function(lb) as.integer(sum((2^(0:31))[lb]))

"%AND%" <- function(x, y)

 

35 %AND% 42 # 34

 

===Using ''bitops'' package===

bitAnd(35, 42) # 34

bitOr(35, 42) # 43

bitShiftL(35, 1) # 70

bitShiftR(35, 1) # 17

=={{header|Racket}}==

#lang racket

(define a 255)

(arithmetic-shift a b) ; left shift

(arithmetic-shift a (- b))) ; right shift

Output:

<pre>

'(5 255 250 -256 8160 7)

</pre>

=={{header|Raku}}==

(formerly Perl 6)

{{works with|Rakudo|2017.05}}

constant BITS = MAXINT.base(2).chars;

 

sub say_bit ($message, $value) {

printf("%30s: %{'0' ~ BITS}b\n", $message, $value +& MAXINT);

{{out}}

<pre> 7: 0000000000000000000000000000000000000000000000000000000000000111

-65432 shift left 31: 1111111111111111100000000011010000000000000000000000000000000000

-65432 rotate left 31: 1111111111111111100000000011010001111111111111111111111111111111</pre>

=={{header|Red}}==

 

a: 10

; there are no circular shift operators in Red

]

{{out}}

<pre>

a << b: 40

</pre>

=={{header|Retro}}==

There is no predefined arithmetic shifts in Retro.

 

: bitwise ( ab- )

cr

2over << "a << b = %d\n" puts

2over >> "a >> b = %d\n" puts

=={{header|REXX}}==

<pre>

╚═══════════════════════════════════════════════════════════════════════════════════════╝

</pre>

numeric digits 1000 /*be able to handle ginormous integers.*/

say center('decimal', 9) center("value", 9) center('bits', 50)

bOr: return c2d( bitor( d2c( arg(1) ), d2c( arg(2) ) ) )

bXor: return c2d( bitxor( d2c( arg(1) ), d2c( arg(2) ) ) )

{{out|output}}

<pre>

2 A [»B] 10

</pre>

=={{header|Ring}}==

x = 8

y = 2

see "x << y - Binary Left Shift : " + (x << y) + nl

see "x >> y - Binary Right Shift : " + (x >> y) + nl

=={{header|RLaB}}==

 

are integers then the result of the operation is an integer as well.

 

>> y = int(1);

>> z = x && y; printf("0x%08x\n",z); // logical 'and'

0x00000006

>> z = x / i2; printf("0x%08x\n",z); // right-shift is division by 2 where both arguments are integers

=={{header|Robotic}}==

input string "First value"

set "local1" to "input"

end

. "Bitwise rotation is not natively supported"

 

=={{header|Ruby}}==

form = "%1$7s:%2$6d %2$016b"

puts form % ["a", a]

end

 

 

{{out}}

 

=={{header|Rust}}==

let a: u8 = 105;

let b: u8 = 91;

println!("a << 3 = {:0>8b}", a << 3);

println!("a >> 3 = {:0>8b}", a >> 3);

 

Output:

a >> 3 = 00001101

</pre>

=={{header|SAS}}==

data _null_;

a=105;

h=brshift(a,1);

put _all_;

 

=={{header|Scala}}==

 

println("a and b: " + (a & b))

println("a or b: " + (a | b))

println("a rot b: " + Integer.rotateLeft(a, b)) // Rotate Left

println("a rol b: " + Integer.rotateRight(a, b)) // Rotate Right

 

=={{header|Scheme}}==

{{Works with|Scheme|R<math>^6</math>RS}}

 

(define (bitwise a b)

(newline))

 

Output:

255

250

-256

 

''Note: bitwise operations were also described in [http://srfi.schemers.org/srfi-60/ SRFI-60], with additional aliases (and previously discussed in [http://srfi.schemers.org/srfi-33/ SRFI-33] which remained draft).''

=={{header|Seed7}}==

The type [http://seed7.sourceforge.net/manual/types.htm#integer integer] is intended for arithmetic operations.

Right shifting of bin32 values is done with logical shifts.

 

include "bin32.s7i";

 

bitwise(65076, 6);

bitwise(bin32(65076), bin32(6));

 

{{out}}

a rolR b: 11010000000000000000001111111000

</pre>

=={{header|Sidef}}==

say ('a and b : ', a & b)

say ('a or b : ', a | b)

}

{{out}}

<pre>

a >> b : 1

</pre>

=={{header|Simula}}==

COMMENT TO MY KNOWLEDGE SIMULA DOES NOT SUPPORT BITWISE OPERATIONS SO WE MUST WRITE PROCEDURES FOR THE JOB ;

INTEGER WORDSIZE;

END;

END

{{out}}

<pre>A AND B : 2

A ROTR B : -1073741823

</pre>

=={{header|Slate}}==

 

inform: (a bitAnd: b) printString.

inform: (a >> b) printString.

 

'''Bold text'''

=={{header|Smalltalk}}==

{{works with|GNU Smalltalk}}

{{works with|VisualWorks Smalltalk}}

Since [[GNU Smalltalk]] by default runs without a graphical user interface, I wrote the program in that dialect. The actual methods for bitwise operations (''bitAnd:'', etc.) are the same in all implementations.

testBitFunc := [ :a :b |

('%1 and %2 is %3' % { a. b. (a bitAnd: b) }) displayNl.

('%1 right shift %2 is %3' % { a. b. (a bitShift: (b negated)) }) displayNl.

].

 

in addition to the above,

{{works with|Smalltalk/X}}

(a bitAt: index) "retrieve a bit (bit-index, one-based)"

(a setBit: index) "set a bit (bit-index)"

lowBit "find the index of the lowest one-bit; zero if none"

highBit "find the index of the highest one-bit; zero if none"

 

Notice that all of those work on arbitrarily large integers (i.e. 1000 factorial lowBit -> 995).

 

=={{header|Standard ML}}==

For integers, IntInfs provide bitwise operations:

print ("a and b: " ^ IntInf.toString (IntInf.andb (IntInf.fromInt a, IntInf.fromInt b)) ^ "\n");

print ("a or b: " ^ IntInf.toString (IntInf.orb (IntInf.fromInt a, IntInf.fromInt b)) ^ "\n");

print ("a lsl b: " ^ IntInf.toString (IntInf.<< (IntInf.fromInt a, Word.fromInt b )) ^ "\n"); (* left shift *)

print ("a asr b: " ^ IntInf.toString (IntInf.~>> (IntInf.fromInt a, Word.fromInt b )) ^ "\n") (* arithmetic right shift *)

More shifts are available for words (unsigned ints):

print ("a and b: " ^ Word.fmt StringCvt.DEC (Word.andb (a, b)) ^ "\n");

print ("a or b: " ^ Word.fmt StringCvt.DEC (Word.orb (a, b)) ^ "\n");

print ("a asr b: " ^ Word.fmt StringCvt.DEC (Word.~>> (a, b) ) ^ "\n"); (* arithmetic right shift *)

print ("a asr b: " ^ Word.fmt StringCvt.DEC (Word.>> (a, b) ) ^ "\n") (* logical right shift *)

 

=={{header|Stata}}==

Stata does not have bitwise operators as of version 15.1. It's possible to use Mata functions '''[https://www.stata.com/help.cgi?mf_inbase inbase]''' and '''frombase''' to convert integers to binary strings, and operate on these, but it will be much slower than native operators. William Matsuoka has written functions for this [http://www.wmatsuoka.com/stata/building-an-api-library here].

=={{header|Swift}}==

// All bitwise operations (including shifts)

// require both operands to be the same type

}

 

{{out}}

<pre>

a lsr b: 2305843009213693950

</pre>

=={{header|SystemVerilog}}==

Verilog, being a hardware description language, had pretty comprehensive support for bit twiddling; though rotation is still a slightly manual operation. Just to be different, I decided to use a couple of 53-bit integers:

 

initial begin

end

 

 

If we want to do a variable bit rotation, then we need to think in hardware terms, and build a mux structure (this could be a function, but using a module allows it to be parameterized:

 

 

parameter BITS = 32;

always_comb foreach (out[i]) out[i] = in[ (i+shift) % BITS ];

 

 

of course, one could always write the foreach loop inline.

=={{header|Tailspin}}==

Bytes values are infinitely extended to the left by sign extension when needed. The shift message can be used for all types of shifts, depending on the fill pattern which is infinitely repeated as needed to supply bits for vacated positions.

def a: [x f075 x];

def b: [x 81 x];

$a::shift&{left: 3, fill: $a} -> '$a; rotated left 3 bits is $;$#10;' -> !OUT::write

$a::shift&{left: -3, fill: $a} -> '$a; rotated right 3 bits is $;$#10;' -> !OUT::write

{{out}}

<pre>

f075 rotated right 3 bits is be0e

</pre>

=={{header|Tcl}}==

puts [format "a and b: %#08x" [expr {$a & $b}]]

puts [format "a or b: %#08x" [expr {$a | $b}]]

puts [format "a << b: %#08x" [expr {$a << $b}]]

puts [format "a >> b: %#08x" [expr {$a >> $b}]]

There are no built-in operations for arithmetic right shift or for bit rotation. Indeed, rotation precludes the use of arbitrary-width integers and can only be defined with respect to a particular width. However, we can simulate these operations for 32-bit values (requires Tcl 8.5):

set bits 0xFFFFFFFF

# Force interpretation as a 32-bit unsigned value

(($a >> (32-$b)) & ($bits ^ ($bits << $b)))

}]]

=={{header|TI-89 BASIC}}==

 

The right shift operation fills the new leftmost bit with a copy of the old leftmost bit.

 

Prgm

Local show, oldbase

show("RRo ", rotate(a,–b))

setMode("Base",oldbase)

 

=={{header|Vala}}==

print(@"input: a = $a, b = $b\n");

print(@"AND: $a & $b = $(a & b)\n");

int b = 2;

testbit(a,b);

{{out}}

<pre>input: a = 255, b = 2

NOT: ~255 = -256

</pre>

=={{header|VBA}}==

In VBA, the logical operators And, Or, Xor, Not are actually binary operators. There are also Eqv and Imp (for bitwise "equivalence" and "logical implication").

 

Debug.Print Hex(&HF0F0 Or &HFF00) 'FFF0

Debug.Print Hex(&HF0F0 Xor &HFF00) 'FF0

Debug.Print Hex(&HF0F0 Eqv &HFF00) 'F00F

Debug.Print Hex(&HF0F0 Imp &HFF00) 'FF0F

 

The other operations in the task are not builtin, but are easy to implement. Integers are signed, and overflow throws and exception, one must take care of this.

 

If k < 1 Then

MaskL = 0

Function TestBit(n As Long, k As Integer) As Boolean

TestBit = (n And Bit(k)) <> 0

 

Examples

 

Debug.Print Hex(MaskR(8)) 'FF

Debug.Print Hex(Bit(7)) '80

Debug.Print Hex(RotateR(65535, 8)) 'FF0000FF

Debug.Print Hex(RotateR(65535, -8)) 'FFFF00

=={{header|Visual Basic}}==

{{works with|Visual Basic|VB6 Standard}}

identical syntax as in [[#VBA]].

=={{header|Visual Basic .NET}}==

WriteLine("And " & a And b)

WriteLine("Or " & a Or b)

WriteLine("Left Shift " & a << 2)

WriteLine("Right Shift " & a >> 2)

 

Visual Basic doesn't have built-in support for bitwise rotation.

=={{header|Wren}}==

In Wren all numbers are represented in 64-bit floating point form.

 

Given this limitation, there is no difference between logical and arithmetic left and right shift operations. Although Wren doesn't support circular shift operators, it is not difficult to write functions to perform them.

 

var rr = Fn.new { |x, y| x >> y | x << (32-y) }

}

 

 

{{out}}

{{works with|nasm}}

It must be linked with the libc and "start" code; lazyly a <tt>gcc bitops.o</tt> works, being bitops.o produced by <tt>nasm -f elf bitops.asm</tt> (I've chosen ELF since I am on a GNU/Linux box)

global main

_null db 0

 

=={{header|XBasic}}==

{{works with|Windows XBasic}}

PROGRAM "bitwise"

 

END FUNCTION

END PROGRAM

{{out}}

<pre>

10101 Rotr 11: 10100000000000000000000000000010

</pre>

=={{header|XLISP}}==

; rotate operations are not supported

(print `(,a and ,b = ,(logand a b)))

(print `(,a left shift by ,b = ,(lsh a b)))

(print `(,a right shift by ,b = ,(lsh a (- b)))) ; negative second operand shifts right

=={{header|XPL0}}==

Text(0, "A or B = "); HexOut(0, A or B); CrLf(0); \alternate symbol: !

Text(0, "A xor B = "); HexOut(0, A xor B); CrLf(0); \alternate symbol: |

func ROR(A, B); int A, B; return A>>B ! A<<(32-B);

 

 

The reason the "!" and "|" symbols may seem reversed is that the OR

operator was introduced at a time when only uppercase characters were

available (such as on the Apple II). The XOR operator was added later.

=={{header|Yabasic}}==

return right$("00000000" + bin$(n), 8)

end sub

print "OR = \t", formBin$(or(a, b))

print "XOR = \t", formBin$(xor(a, b))

<pre>6 = 00000110

3 = 00000011

XOR = 00000101

NOT 6 = 11111001</pre>

 

=={{header|zkl}}==

No bitwise rotates. Shifts are unsigned.

(8).bitOr(1) //-->9

(7).bitXor(1) //-->6

(7).shiftLeft(1) //-->0xe

(-1).toString(16) //-->ffffffffffffffff

{{omit from|bc|No built-in bitwise operations}}

{{omit from|dc|No built-in bitwise operations}}