llvm::PriorityQueue< T, Sequence, Compare > Class Template Reference

#include <PriorityQueue.h>

Inheritance diagram for llvm::PriorityQueue< T, Sequence, Compare >:

[legend]

Collaboration diagram for llvm::PriorityQueue< T, Sequence, Compare >:

[legend]

List of all members.

Public Member Functions
	PriorityQueue (const Compare &compare=Compare(), const Sequence &sequence=Sequence())
template<class Iterator>
	PriorityQueue (Iterator begin, Iterator end, const Compare &compare=Compare(), const Sequence &sequence=Sequence())
void	erase_one (const T &t)
void	reheapify ()
void	clear ()

---

Detailed Description

template<class T, class Sequence = std::vector<T>, class Compare = std::less<typename Sequence::value_type>>
class llvm::PriorityQueue< T, Sequence, Compare >

PriorityQueue - This class behaves like std::priority_queue and provides a few additional convenience functions.

Definition at line 27 of file PriorityQueue.h.

---

Constructor & Destructor Documentation

template<class T, class Sequence = std::vector<T>, class Compare = std::less<typename Sequence::value_type>>

llvm::PriorityQueue< T, Sequence, Compare >::PriorityQueue	(	const Compare &	compare = Compare(),
		const Sequence &	sequence = Sequence()
	)			[inline, explicit]

Definition at line 29 of file PriorityQueue.h.

template<class T, class Sequence = std::vector<T>, class Compare = std::less<typename Sequence::value_type>>

template<class Iterator>

llvm::PriorityQueue< T, Sequence, Compare >::PriorityQueue	(	Iterator	begin,
		Iterator	end,
		const Compare &	compare = Compare(),
		const Sequence &	sequence = Sequence()
	)			[inline]

Definition at line 35 of file PriorityQueue.h.

---

Member Function Documentation

template<class T, class Sequence = std::vector<T>, class Compare = std::less<typename Sequence::value_type>>

void llvm::PriorityQueue< T, Sequence, Compare >::erase_one

(

const T &

t

)

[inline]

erase_one - Erase one element from the queue, regardless of its position. This operation performs a linear search to find an element equal to t, but then uses all logarithmic-time algorithms to do the erase operation.

Definition at line 46 of file PriorityQueue.h.

template<class T, class Sequence = std::vector<T>, class Compare = std::less<typename Sequence::value_type>>

void llvm::PriorityQueue< T, Sequence, Compare >::reheapify

(

)

[inline]

reheapify - If an element in the queue has changed in a way that affects its standing in the comparison function, the queue's internal state becomes invalid. Calling reheapify() resets the queue's state, making it valid again. This operation has time complexity proportional to the number of elements in the queue, so don't plan to use it a lot.

Definition at line 70 of file PriorityQueue.h.

template<class T, class Sequence = std::vector<T>, class Compare = std::less<typename Sequence::value_type>>

void llvm::PriorityQueue< T, Sequence, Compare >::clear

(

)

[inline]

clear - Erase all elements from the queue.

Definition at line 76 of file PriorityQueue.h.

---

The documentation for this class was generated from the following file:

• PriorityQueue.h