The use of bit operations in PHP

The following is an article about the uses of PHP bit operations. Let me share it with you now and give it as a reference for everyone. Let’s take a look together

In practical applications, user permissions can be used

The permission management method I mentioned here is a commonly used method, mainly using the "bit operator" ” operation, & bit and operator, | bit or operator. If the number involved in the operation is a decimal number, it will be converted into a binary number to participate in the operation, and then the calculation result will be converted into a decimal number and output.

Its permission value is like this

2^0=1, the corresponding 2-digit number is "0001" (here^I Expressed as "power", that is: 2 raised to the 0th power, the same below)

2^1=2, the corresponding 2-ary number is "0010"
2^2=4, the corresponding 2-ary number The number is "0100"
2^3=8, and the corresponding binary number is "1000"

To determine whether a number is within a certain number range, you can use the & operator (the value is from the table above Winning)

For example: 7=4|2|1　(You can also simply understand it as 7=4 2 1)

Use & to operate, you can know that 7&4, 7&2, 7&1 are all true, and if 7&8 is false,

&, | If you are not familiar with it, you should check the manual to see how it is used.

Let’s look at an example:

// 赋予权限值-->删除：8、上传：4、写入：2、只读：1
define(“mDELETE”,8);
define(“mUPLOAD”,4);
define(“mWRITE”,2);
define(“mREAD”,1);
//vvvvvvvvvvvvv使用说明vvvvvvvvvvvvv
//部门经理的权限为(假设它拥有此部门的所有权限)，| 是位或运行符，不熟悉的就查查资料
echo mDELETE|mUPLOAD|mWRITE|mREAD ,”
“;// 相当于是把上面的权限值加起来：8+4+2+1=15
// 设我只有 upload 和 read 权限，则
echo mUPLOAD|mREAD ,”
“;//相当于是把上传、只读的权限值分别相加：4+1=5
/*
*赋予它多个权限就分别取得权限值相加，又比如某位员工拥有除了删除外的权限其余都拥有，那它的权限值是多少?
*应该是：4+2+1＝7
*明白了怎么赋值给权限吧?
*/
//^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
//判断某人的权限可用，设权限值在$key中
/*
*判断权限用&位与符，
*/
$key = 13;//13＝8+4+1
if($key & mDELETE) echo “有删除权限
“; //8
if($key & mUPLOAD) echo “有上传权限
“; //4
$a=$key & mWRITE; echo “有写权限
“.$a; //无此权限
if($key & mREAD) echo “有读权限
“; //1
?>

OK, here’s the permission score One of the algorithms is like this, which can be said to be simple and efficient. I don’t know if you understand it or not. It doesn’t matter if you don’t. Just remember the examples. The premise is to distribute the permission values ​​well, that is, 1, 2, 4, 8, 16... (There is also an order issue here. The higher the permissions, the higher the permission values, such as the deletion demonstrated in the above example. permissions). With the permission distribution table, you can determine what permissions are given to a person. You can simply understand that which permissions you want, just add the corresponding permission values.

This method is very easy to use. The disadvantage is that if the permissions are distributed finely, the permission value will become larger and larger. Think about it for yourself, how many powers of 2, if all the permissions are required? Add it all up. But for general permissions this is enough.

The following are some simple application examples

(1) Determine whether the int type variable a is an odd or even number

a&1 = 0 even number

a&1 = 1 odd number

(2) Take the k-th bit (k =0,1,2...sizeof(int)), that is, a>>k&1

(3) Change the k-th bit of int type variable a Clear 0, that is, a=a&~(107624d31bcd202e7911ee7d51f9e7fb8

(4) Change the kth value of int type variable a Position 1, that is, a=a|(107624d31bcd202e7911ee7d51f9e7fb8

(5) The int variable is circularly shifted to the left k times , that is, a=aa8093152e673feb7aba1828c4353209416-k (assuming sizeof(int)=16)

(6) The int type variable a loops to the right k times , that is, a=a>>k|ab3f15c1ca43f2cea881058664fe16ab9= 0, determine whether it is a power of 2

boolean power2(int x)

{

return ((x&(x-1))==0)&&(x!=0)；

}

(9) No need temp exchanges two integers

void swap(int x , int y)

{

x ^= y;

y ^= x;

x ^= y;

}

##(10) Calculate the absolute value

int abs( int x )

{

int y ;

y = x >> 31 ;

return (x^y)-y ; //or: (x+y)^y

}

##(11) Modulo operation is converted into bit operation (without overflow)

a % (2^n) is equivalent to a & (2^n – 1)

(12) Multiplication operations are converted into bit operations (without overflow) In the case)

##a * (2^n) is equivalent to af190aa352eec5bebd5a31ca1b5edc281> nExample: 12/8 == 12>>3

##(14) a % 2 is equivalent to a & 1

(15) if (x == a) x= b;

else x= a; Equivalent to x= a ^ b ^ x;

(16) The opposite number of Shift left in the case of 32 bits

Related recommendations:

detailed examples of php bit operator permission operations

The above is the detailed content of The use of bit operations in PHP. For more information, please follow other related articles on the PHP Chinese website!