Message228211
@Georg: I don't think it would be as common but do agree it'd be useful.
I think it can be implemented "efficiently" in pure Python currently.
def with_bits(i, value, pos, width=1):
width = min(width, value.bit_length())
mask = ((1 << width) - 1)
v = value & mask
i = i & ~(mask << pos)
return i | (v << pos) |
|
Date |
User |
Action |
Args |
2014-10-02 11:01:05 | anon | set | recipients:
+ anon, tim.peters, georg.brandl, rhettinger, mark.dickinson, pitrou, vstinner, meador.inge, martin.panter, serhiy.storchaka, hct, josh.r |
2014-10-02 11:01:05 | anon | set | messageid: <1412247665.18.0.204687862524.issue19915@psf.upfronthosting.co.za> |
2014-10-02 11:01:05 | anon | link | issue19915 messages |
2014-10-02 11:01:05 | anon | create | |
|