Given an integer x and a nonnegative integer shift, return closest integer to x / 2**shift; use round-to-even in case of a tie.
(x, shift)
| 5687 | return a |
| 5688 | |
| 5689 | def _rshift_nearest(x, shift): |
| 5690 | """Given an integer x and a nonnegative integer shift, return closest |
| 5691 | integer to x / 2**shift; use round-to-even in case of a tie. |
| 5692 | |
| 5693 | """ |
| 5694 | b, q = 1 << shift, x >> shift |
| 5695 | return q + (2*(x & (b-1)) + (q&1) > b) |
| 5696 | |
| 5697 | def _div_nearest(a, b): |
| 5698 | """Closest integer to a/b, a and b positive integers; rounds to even |
no outgoing calls
no test coverage detected
searching dependent graphs…