For the record, there's another contender in the allocator competition now: https://github.com/microsoft/mimalloc/
Regards Antoine. On 2019年6月24日 00:20:03 -0500 Tim Peters <[email protected]> wrote: > [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 the size classes of the most popular > objects. A program below to compute it all. For a 64-bit box using > 3.8 alignment, and 16 KiB pools: [snip] _______________________________________________ Python-Dev mailing list -- [email protected] To unsubscribe send an email to [email protected] https://mail.python.org/mailman3/lists/python-dev.python.org/ Message archived at https://mail.python.org/archives/list/[email protected]/message/LWVFZYVFLTCNL7AKJVH2HLD2CHFRATUB/