PHP教程之变量互换_PHP
程序员文章站
2022-05-01 10:57:55
...
Attributed to Solomon W. Golomb; a method for swapping the values of two integer variables without using an intermediate variable (you can tell this dates from the Elder Days, when variables were expensive!). Thanks to PHP's syntax it's also a one-liner.
$a^=$b^=$a^=$b;
Okay, here's how it goes (yeah, like I need to make content-free posts just for the sake of an increment...
).
First, simplify the line; noting that ^= is right-associative, which means that in that line the rightmost operator is evaluated first, that the assignment operators also return the value that they assign to their lvalue, and that foo^=bar is shorthand for foo=foo^bar:
$a^=$b^=$a^=$b;
Okay, here's how it goes (yeah, like I need to make content-free posts just for the sake of an increment...
First, simplify the line; noting that ^= is right-associative, which means that in that line the rightmost operator is evaluated first, that the assignment operators also return the value that they assign to their lvalue, and that foo^=bar is shorthand for foo=foo^bar:
Code:
$a^=$b^=$a^=$b; $a^=($b^=($a^=$b)); $a=$a^b; $a^=($b^=$a); $a=$a^$b; $b=$b^$a; $a=$a^$b;
Recall what ^ does. Takes each pair of corresponding bits from its arguments (the internal binary representation of its arguments, that is), and xors them together to produce the corresponding bit of the result ("corresponding" means that the first bits of both arguments produce the first bit of the result, the second bits of both arguments produce the second bit of the result, and so on. This is why, as BuzzLY noted, it's important that both variables are the same size - demons probably start flying out of your nose if one of them runs out of bits to xor before the other. So to figure out what ^ does to a pair of variables, we only need to recap what it does to single bitsCode:x y | x^y ------+---- 0 0 | 0 0 1 | 1 1 0 | 1 1 1 | 0 Basically, x^y is true if x and y are different, and is false otherwise. In other words, x is true or y is true, but they're not both true. Hence, "exclusive-or".
Now, taking those three lines, we see what happens when $a and $b start out with initial values $s and $t.Code:$a = $s; $b = $t; $a=$a^$b; $b=$b^$a; $a=$a^$b; // Since $b==$t, we substitute $t for $b for as long as $b doesn't change $a = $s; $a=$a^$t; $b=$t^$a; $a=$a^$b; // And likewise for $a $a=$s^$t; $b=$t^$a; $a=$a^$b; // But don't stop there! $b=$t^($s^$t); $a=($s^$t)^$b; $b=$t^($s^$t); $a=($s^$t)^($t^($s^$t));
From the table above, it's obvious that $a^$b=$b^$a (if $a is different from $b, then $b must be different from $a), and that $a^$a=0 ($a is not different from itself). Using those two facts, that the fact that $a^0 = $a and $a^($b^$c) = ($a^$b)^$c (which I leave as exercises for the reader), we can simplify those two rather long expressions.Code:$b=$t^($s^$t); $a=($s^$t)^($t^($s^$t)); $b=$t^($t^$s); $a=($t^$s)^($t^($t^$s)); $b=($t^$t)^$s; $a=($t^$s)^(($t^$t)^$s); $b=0^$s; $a=($t^$s)^(0^$s); $b=$s; $a=($t^$s)^$s; $b=$s; $a=$t^($s^$s); $b=$s; $a=$t^0; $b=$s; $a=$t;
So after starting out with $a=$s and $b=$t, we end up with $a=$t and $b=$s. In other words, ^ swapped the each pair of bits of $a and $b with each other. Do that for all the bits and the result is one of $a and $b being swapped.
And after all that is it any mystery why (a) XOR is such a useful operation in cryptography, and (b) learning a bit of maths (boolean algebra in this case) can be useful in programming?声明：本文内容由网友自发贡献，版权归原作者所有，本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容，请联系admin@php.cn核实处理。
相关文章
相关视频
专题推荐
独孤九贱-php全栈开发教程
全栈 170W+
主讲：Peter-Zhu 轻松幽默、简短易学，非常适合PHP学习入门
玉女心经-web前端开发教程
入门 80W+
主讲：灭绝师太 由浅入深、明快简洁，非常适合前端学习入门
天龙八部-实战开发教程
实战 120W+
主讲：西门大官人 思路清晰、严谨规范，适合有一定web编程基础学习
作者信息
- 最新文章
- 热门排行
下一篇： 微信怎样进行本地调试
网友评论
文明上网理性发言，请遵守 新闻评论服务协议
我要评论