Galois::MinHeap< T, Cmp, Cont > Class Template Reference

#include <PriorityQueue.h>

List of all members.

Classes
struct	RevCmp
Public Types
typedef Cont	container_type
typedef container_type::value_type	value_type
typedef container_type::reference	reference
typedef container_type::const_reference	const_reference
typedef container_type::pointer	pointer
typedef container_type::size_type	size_type
typedef container_type::const_iterator	iterator
typedef container_type::const_iterator	const_iterator
typedef container_type::const_reverse_iterator	reverse_iterator
typedef container_type::const_reverse_iterator	const_reverse_iterator
Public Member Functions
	MinHeap (const Cmp &cmp=Cmp(), const Cont &container=Cont())
template<typename Iter >
	MinHeap (Iter b, Iter e, const Cmp &cmp=Cmp())
bool	empty () const
size_type	size () const
const_reference	top () const
void	push (const value_type &x)
value_type	pop ()
bool	remove (const value_type &x)
bool	find (const value_type &x) const
const_iterator	begin () const
const_iterator	end () const
void	reserve (size_type s)
Protected Member Functions
const_reference	top_internal () const
value_type	pop_internal ()
Protected Attributes
Cont	container
RevCmp	revCmp

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>
class Galois::MinHeap< T, Cmp, Cont >

---

Member Typedef Documentation

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

typedef container_type::const_iterator Galois::MinHeap< T, Cmp, Cont >::const_iterator

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

typedef container_type::const_reference Galois::MinHeap< T, Cmp, Cont >::const_reference

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

typedef container_type::const_reverse_iterator Galois::MinHeap< T, Cmp, Cont >::const_reverse_iterator

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

typedef Cont Galois::MinHeap< T, Cmp, Cont >::container_type

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

typedef container_type::const_iterator Galois::MinHeap< T, Cmp, Cont >::iterator

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

typedef container_type::pointer Galois::MinHeap< T, Cmp, Cont >::pointer

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

typedef container_type::reference Galois::MinHeap< T, Cmp, Cont >::reference

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

typedef container_type::const_reverse_iterator Galois::MinHeap< T, Cmp, Cont >::reverse_iterator

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

typedef container_type::size_type Galois::MinHeap< T, Cmp, Cont >::size_type

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

typedef container_type::value_type Galois::MinHeap< T, Cmp, Cont >::value_type

---

Constructor & Destructor Documentation

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

Galois::MinHeap< T, Cmp, Cont >::MinHeap	(	const Cmp &	cmp = Cmp(),
		const Cont &	container = Cont()
	)			[inline, explicit]

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

template<typename Iter >

Galois::MinHeap< T, Cmp, Cont >::MinHeap	(	Iter	b,
		Iter	e,
		const Cmp &	cmp = Cmp()
	)			[inline]

---

Member Function Documentation

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

const_iterator Galois::MinHeap< T, Cmp, Cont >::begin

(

)

const [inline]

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

bool Galois::MinHeap< T, Cmp, Cont >::empty

(

)

const [inline]

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

const_iterator Galois::MinHeap< T, Cmp, Cont >::end

(

)

const [inline]

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

bool Galois::MinHeap< T, Cmp, Cont >::find

(

const value_type &

x

)

const [inline]

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

value_type Galois::MinHeap< T, Cmp, Cont >::pop

(

)

[inline]

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

value_type Galois::MinHeap< T, Cmp, Cont >::pop_internal

(

)

[inline, protected]

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

void Galois::MinHeap< T, Cmp, Cont >::push

(

const value_type &

x

)

[inline]

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

bool Galois::MinHeap< T, Cmp, Cont >::remove

(

const value_type &

x

)

[inline]

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

void Galois::MinHeap< T, Cmp, Cont >::reserve

(

size_type

s

)

[inline]

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

size_type Galois::MinHeap< T, Cmp, Cont >::size

(

)

const [inline]

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

const_reference Galois::MinHeap< T, Cmp, Cont >::top

(

)

const [inline]

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

const_reference Galois::MinHeap< T, Cmp, Cont >::top_internal

(

)

const [inline, protected]

---

Member Data Documentation

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

Cont Galois::MinHeap< T, Cmp, Cont >::container [protected]

template<typename T, typename Cmp = std::less<T>, typename Cont = std::vector<T>>

RevCmp Galois::MinHeap< T, Cmp, Cont >::revCmp [protected]

---

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

• PriorityQueue.h