traverseda
/
cpython
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

More timings suggest that 2500 is closer to the break-even point.

This commit is contained in:
Raymond Hettinger 2015-05-12 21:40:50 -07:00
parent ffcd8490d0
commit 636488043b
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Modules/_heapqmodule.c
View File

@ -335,7 +335,7 @@ heapify_internal(PyObject *heap, int siftup_func(PyListObject *, Py_ssize_t))
in cache, we prefer the simpler algorithm with less branching.
*/
n = PyList_GET_SIZE(heap);
if (n > 10000)
if (n > 2500)
return cache_friendly_heapify(heap, siftup_func);
/* Transform bottom-up. The largest index there's any point to