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. |
||
---|---|---|
.. | ||
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 |