| commit | 1c263e39c4ed28225a7dc8ca1f24953225ac48ca | [log] [tgz] |
|---|---|---|
| author | Tim Peters <tim.peters@gmail.com> | Fri May 31 21:16:04 2019 -0500 |
| committer | GitHub <noreply@github.com> | Fri May 31 21:16:04 2019 -0500 |
| tree | 5ed4207eb76f5bfcbf77a0827435aa9cc0681eda | |
| parent | 549e55a3086d04c13da9b6f33214f6399681292a [diff] |
bpo-37029: keep usable_arenas in sorted order without searching (#13612) This adds a vector of "search fingers" so that usable_arenas can be kept in sorted order (by number of free pools) via constant-time operations instead of linear search. This should reduce worst-case time for reclaiming a great many objects from O(A**2) to O(A), where A is the number of arenas. See bpo-37029.