6bafa6678f
Initial implementation of a twopass pairing heap with aux list. Research papers linked in comments. Where search/nsearch/last aren't needed, this gives much faster first(), delete(), and insert(). Insert is O(1), and first/delete don't have to walk the whole tree. Also tested rb_old with parent pointers - it was better than the current rb.h for memory loads, but still much worse than a pairing heap. An array-based heap would be much faster if everything fits in memory, but on a cold cache it has many more memory loads for most operations. |
||
|---|---|---|
| .. | ||
| internal | ||
| jemalloc_defs.h.in | ||
| jemalloc_macros.h.in | ||
| jemalloc_mangle.sh | ||
| jemalloc_protos.h.in | ||
| jemalloc_rename.sh | ||
| jemalloc_typedefs.h.in | ||
| jemalloc.sh | ||