push()

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

void fl::PriorityQueue< T, Compare, VectorT >::push ( const T & value )

inline

Definition at line 76 of file priority_queue.h.

                              {
        _data.push_back(value);
        push_heap(_data.begin(), _data.end(), _comp);
    }

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

Here is the call graph for this function: