pop()

template<typename T, typename Compare = fl::less<T>, typename VectorT = fl::HeapVector<T>>

void fl::PriorityQueue< T, Compare, VectorT >::pop ( )

inline

Definition at line 81 of file priority_queue.h.

               {
        pop_heap(_data.begin(), _data.end(), _comp);
        _data.pop_back();
    }

References _comp, _data, and fl::pop_heap().

Here is the call graph for this function: