Message106431
| Author |
mark.dickinson |
| Recipients |
mark.dickinson |
| Date |
2010年05月25日.12:55:57 |
| SpamBayes Score |
3.9621624e-05 |
| Marked as misclassified |
No |
| Message-id |
<1274792162.57.0.293855829379.issue8817@psf.upfronthosting.co.za> |
| In-reply-to |
| Content |
The implementation of 'round' for Python integers uses a round-to-nearest form of divmod: a, b -> q, r, where q is the nearest integer to a / b and r = a - b*q.
This form of divmod would be useful elsewhere. In particular, it's currently needed for implementing multiplication and division of timedeltas by a float: see issue 1289118 .
This patch exposes the operation to Python C code as _PyLong_Divmod_Near, and refactors long_round to use this operation. |
|
History
|
|---|
| Date |
User |
Action |
Args |
| 2010年05月25日 12:56:02 | mark.dickinson | set | recipients:
+ mark.dickinson |
| 2010年05月25日 12:56:02 | mark.dickinson | set | messageid: <1274792162.57.0.293855829379.issue8817@psf.upfronthosting.co.za> |
| 2010年05月25日 12:56:00 | mark.dickinson | link | issue8817 messages |
| 2010年05月25日 12:56:00 | mark.dickinson | create |
|