| commit | b4bc5cab82e6855e4ebc33ba0b669ddffad30fb3 | [log] [tgz] |
|---|---|---|
| author | Sanyam Khurana <8039608+CuriousLearner@users.noreply.github.com> | Sat Jul 28 10:45:50 2018 +0530 |
| committer | Nick Coghlan <ncoghlan@gmail.com> | Sat Jul 28 15:15:50 2018 +1000 |
| tree | a01af1d1f1dfe3707ca0cbff78926775d06ccfd3 | |
| parent | 612dbefe9dfce0f67bce358613e472e913be8a57 [diff] |
bpo-29710: Clarify documentation for Bitwise binary operation (GH-1691) Mathematically, bitwise operations on integers behave as if there were an infinite number of sign bits. Pragmatically, that gives the same answer as using one extra sign bit for the bitwise logical operations.