cc75c35db5
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. |
||
---|---|---|
.. | ||
include/test | ||
integration | ||
src | ||
stress | ||
unit | ||
test.sh.in |