push() [2/2]

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

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

inline

Definition at line 90 of file priority_queue.h.

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

References _comp, _data, fl::fl::move(), fl::push_heap(), and fl::type_rank< T >::value.

Here is the call graph for this function: