diff options
| author | Raymond Hettinger <python@rcn.com> | 2015-05-13 04:40:50 (GMT) |
|---|---|---|
| committer | Raymond Hettinger <python@rcn.com> | 2015-05-13 04:40:50 (GMT) |
| commit | 636488043b490ab70413990b458443aa41f504b2 (patch) | |
| tree | b462b68ffe2af1e07d527e428778f5ce99fdf53d /Modules | |
| parent | ffcd8490d04727ff2a45f380b27e437c0c9e49f4 (diff) | |
| download | cpython-636488043b490ab70413990b458443aa41f504b2.zip cpython-636488043b490ab70413990b458443aa41f504b2.tar.gz cpython-636488043b490ab70413990b458443aa41f504b2.tar.bz2 | |
More timings suggest that 2500 is closer to the break-even point.
Diffstat (limited to 'Modules')
| -rw-r--r-- | Modules/_heapqmodule.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Modules/_heapqmodule.c b/Modules/_heapqmodule.c index 01b35be..88c35cf 100644 --- a/Modules/_heapqmodule.c +++ b/Modules/_heapqmodule.c @@ -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 |