This issue tracker has been migrated to GitHub, and is currently read-only.
For more information, see the GitHub FAQs in the Python's Developer Guide.

Author ncoghlan
Recipients CuriousLearner, docs@python, mark.dickinson, martin.panter, ncoghlan, tim.peters, wolma
Date 2017-12-03.01:39:29
SpamBayes Score -1.0
Marked as misclassified Yes
Message-id <1512265170.5.0.213398074469.issue29710@psf.upfronthosting.co.za>
In-reply-to
Content
I like Mark's phrasing as well. For precision, I'd still like to give an exact algorithmic formulation of what "large enough" means in this context, though.

Something like:

    Each bitwise operation has the same result as though carried out in two's complement using a bit-width that's large enough to represent the inputs. ("Large enough" for this purpose is ``1 + max(x.bit_length(), y
.bit_length()``, with the extra bit being needed to handle sign extension appropriately)
History
Date User Action Args
2017-12-03 01:39:30ncoghlansetrecipients: + ncoghlan, tim.peters, mark.dickinson, docs@python, martin.panter, wolma, CuriousLearner
2017-12-03 01:39:30ncoghlansetmessageid: <1512265170.5.0.213398074469.issue29710@psf.upfronthosting.co.za>
2017-12-03 01:39:30ncoghlanlinkissue29710 messages
2017-12-03 01:39:29ncoghlancreate