Carol,
I'm "happy" with Steve's position. Fundamentally I am at fault for
assuming that a combination of the stable ABI and Python's deprecation
policy meant that I could assume that a wheel for Python v3.x would
continue to work for v3.x+1. For this particular change I don't see how
a normal
On Fri, 21 Jun 2019 17:18:18 -0500
Tim Peters wrote:
>
> > And what would be an efficient way of detecting allocations punted to
> > malloc, if not address_in_range?
>
> _The_ most efficient way is the one almost all allocators used long
> ago: use some "hidden" bits right before the address
[Thomas]
>>> And what would be an efficient way of detecting allocations punted to
>>> malloc, if not address_in_range?
[Tim]
>> _The_ most efficient way is the one almost all allocators used long
>> ago: use some "hidden" bits right before the address returned to the
>> user to store info about
[Tim]
> The radix tree generally appears to be a little more memory-frugal
> than my PR (presumably because my need to break "big pools" into 4K
> chunks, while the tree branch doesn't, buys the tree more space to
> actually store objects than it costs for the new tree).
It depends a whole lot on
