Dave Watson 6bafa6678f Pairing heap ...

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.

2016-03-08 13:46:19 -08:00

..

jemalloc

Pairing heap

2016-03-08 13:46:19 -08:00

msvc_compat

Remove errno overrides.

2016-02-29 10:45:49 -08:00