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
..
2017-03-06 18:49:19 -08:00
2017-03-06 15:08:43 -08:00
2017-03-07 10:25:12 -08:00
2017-03-06 15:08:43 -08:00
2017-03-07 10:25:33 -08:00
2017-02-01 16:43:46 -08:00