diff options
| author | Jonathan Turner <jonathandturner@users.noreply.github.com> | 2016-08-31 06:29:08 -0700 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2016-08-31 06:29:08 -0700 |
| commit | 2bfb20f392c6a51ded93e7342fd8c4b163bf8160 (patch) | |
| tree | 3e6b0dc918b36243601e999517bca94f2dcef8c0 /src/test/run-pass/thinlto | |
| parent | 45ca620383ce8f9a5de33c09096bcfddd55fd3d1 (diff) | |
| parent | 8ca9fa11f9a04a7ffa4cded6775336d55268e7ac (diff) | |
| download | rust-2bfb20f392c6a51ded93e7342fd8c4b163bf8160.tar.gz rust-2bfb20f392c6a51ded93e7342fd8c4b163bf8160.zip | |
Rollup merge of #35926 - matthew-piziak:bit-or-xor-examples, r=GuillaumeGomez
add evocative examples for `BitOr` and `BitXor` These are exactly equivalent to PR #35809, with one caveat: I do not believe there is a non-bitwise binary XOR operator in Rust, so here it's expressed as `(a || b) && !(a && b)`. Alternative decompositions are `(a && !b) || (!a && b)` and `(a || b) && (!a || !b)`. Let me know if you think one of those would be clearer. r? @GuillaumeGomez
Diffstat (limited to 'src/test/run-pass/thinlto')
0 files changed, 0 insertions, 0 deletions