Jason Evans cc75c35db5 Add any() and remove_any() to ph. ...

These functions select the easiest-to-remove element in the heap, which
is either the most recently inserted aux list element or the root.  If
no calls are made to first() or remove_first(), the behavior (and time
complexity) is the same as for a LIFO queue.

2017-03-07 10:25:33 -08:00

..

jemalloc

Add any() and remove_any() to ph.

2017-03-07 10:25:33 -08:00

msvc_compat

Replace tabs following #define with spaces.

2017-01-20 21:45:53 -08:00