Less nonsense, just upload the code
The code copy is as follows:
<script type="text/javascript">
//javascript operator
//1. Bitwise non-
var num1=25;//
var num2=~num1;//
alert(num2)
var num3=10;
var num4=~num3;
alert(num4)
var num5=99;
var num6=~num5;
alert(num6)
//Note: I believe everyone has already seen the implementation principle of bitwise ~ (NOT):
//Use num1 and num2 as explanation objects
//Step 1: Convert num1 to binary
//Step 2: Get the inverse code of num1 binary to assign value to num2
//Step 3: Convert num2 to decimal numbers
//Simple explanation: It is to subtract the negative number of the operand value by 1
//2. Bitwise & & (AND)
var result=25 & 3;
alert(result);//1
//Instructions are to convert two numbers into binary numbers according to certain rules:
//The bit result of the second value of the bit
// 1 1 1
// 1 0 0
// 0 1 0
// 0 0 0
//In short, if the corresponding bits of the bitwise operator are all 1, it will return 1, and if any bit is 0, it will return 0.
//Then convert the binary into decimal numbers in the obtained binary
// 25=0000 0000 0000 0000 0000 0000 0001 1001
// 3= 0000 0000 0000 0000 0000 0000 0000 0011
// ------------------------------------------
// AND=0000 0000 0000 0000 0000 0000 0000 0000 0000 0001
//3. Bitwise or | (OR)
var result=25 | 3;
alert(result);//27
//Instructions are to convert two numbers into binary numbers according to certain rules:
//The bit result of the second value of the bit
// 1 1 1
// 1 0 1
// 0 1 1
// 0 0 0
//In short, if a bit of the corresponding bit of the bitwise operator returns 1, it returns 0 only if both bits are 0.
//Then convert the binary into decimal numbers in the obtained binary
// 25=0000 0000 0000 0000 0000 0000 0001 1001
// 3= 0000 0000 0000 0000 0000 0000 0000 0011
// ------------------------------------------
// OR=0000 0000 0000 0000 0000 0000 0000 0001 1011
//4. Bitwise XOR ^ (XOR)
var result= 25 ^ 3;
alert(result);//26
//Instructions are to convert two numbers into binary numbers according to certain rules:
//The bit result of the second value of the bit
// 1 1 0
// 1 0 1
// 0 1 1
// 0 0 0
//In short, this operator (^) returns 1 when there is only one 1 on the corresponding bits of the two numeric values, otherwise it returns 0.
//Then convert the binary into decimal numbers in the obtained binary
// 25=0000 0000 0000 0000 0000 0000 0001 1001
// 3= 0000 0000 0000 0000 0000 0000 0000 0011
// ------------------------------------------
// XOR=0000 0000 0000 0000 0000 0000 0000 0001 1010
//5. Move left (<<)
var oldNum=2;
var newNum=oldNum << 5;
alert(newNum)
//Instructions: shifting 2 (binary number 10) to the left by 5 bits, the result is that 1000000 (binary) is equal to 64
//Note that shifting left will not affect the operator's sign bits. For example, shifting -2 left by 5 bits is -64
//2=0000 0000 0000 0000 0000 0000 0000 0010
//64=0000 0000 0000 0000 0000 0000 010 000000000
//6. Signed right (>>)
var oldNum=64;
var newNum=oldNum >> 5;
//64=0000 0000 0000 0000 0000 0000 010 000000000
//2=0000 0000 0000 0000 0000 0000 0000 0010
alert(newNum)
</script>
The explanation in the comments is very clear. Have you understood the usage of operators in javascript? If you have any questions, please leave me a message.