push_heap() [2/2]

template<typename Iterator, typename Compare>

void fl::push_heap	(	Iterator	first,
		Iterator	last,
		Compare	comp )

Definition at line 38 of file priority_queue.h.

                                                            {
    auto pos = last - 1;
    auto parent = first + ((pos - first) - 1) / 2;
 
    while (pos > first && comp(*parent, *pos)) {
        auto tmp = *parent;
        *parent = *pos;
        *pos = tmp;
 
        pos = parent;
        parent = first + ((pos - first) - 1) / 2;
    }
}

References pos.

Referenced by fl::PriorityQueue< T, Compare, VectorT >::emplace(), fl::PriorityQueue< T, Compare, VectorT >::push(), fl::PriorityQueue< T, Compare, VectorT >::push(), and push_heap().

Here is the caller graph for this function: