dyno::priority_queue< T, Container, Compare > Class Template Reference

#include <PriorityQueue.h>

Collaboration diagram for dyno::priority_queue< T, Container, Compare >:

Public Types
typedef priority_queue< T, Container, Compare >	this_type
typedef Container	container_type
typedef Compare	compare_type
typedef Container::value_type	value_type
typedef Container::reference	reference
typedef Container::const_reference	const_reference
typedef Container::size_type	size_type
typedef Container::difference_type	difference_type

Public Member Functions
DYN_FUNC	priority_queue ()
DYN_FUNC	~priority_queue ()
DYN_FUNC	priority_queue (const container_type &c)
DYN_FUNC	priority_queue (const compare_type &compare)
DYN_FUNC	priority_queue (const container_type &c, const compare_type &compare)
DYN_FUNC bool	empty () const
DYN_FUNC bool	isEmpty () const
DYN_FUNC size_type	size () const
DYN_FUNC const_reference	top () const
DYN_FUNC void	push (const value_type &value)
DYN_FUNC void	pop ()
DYN_FUNC void	clear ()
DYN_FUNC void	change (size_type n)
DYN_FUNC void	remove (size_type n)

Public Attributes
container_type	container

Private Attributes
compare_type	cmp

Detailed Description

template<typename T, typename Container = dyno::RandomAccessContainer<T>, typename Compare = dyno::less<typename Container::value_type>>
class dyno::priority_queue< T, Container, Compare >

priority_queue

The behaviour of this class is just like the std::priority_queue

• empty() check is the priority_queue is empty
• size() return the size
• top() get the top of the priority_queue
• push() push the element and adjust the priority_queue with cmp
• pop() pop the first priority element and adjust the priority_queue
• change() moves the item at the given array index to a new location based on its current priority.
• remove() removes the item at the given array index The container should using randomAccess Container which have such routine: empty(), size(), clear(), insert(), front(), push_back(), pop_back()

Definition at line 41 of file PriorityQueue.h.

Member Typedef Documentation

compare_type

template<typename T, typename Container = dyno::RandomAccessContainer<T>, typename Compare = dyno::less<typename Container::value_type>>

typedef Compare dyno::priority_queue< T, Container, Compare >::compare_type

Definition at line 46 of file PriorityQueue.h.

const_reference

template<typename T, typename Container = dyno::RandomAccessContainer<T>, typename Compare = dyno::less<typename Container::value_type>>

typedef Container::const_reference dyno::priority_queue< T, Container, Compare >::const_reference

Definition at line 50 of file PriorityQueue.h.

container_type

template<typename T, typename Container = dyno::RandomAccessContainer<T>, typename Compare = dyno::less<typename Container::value_type>>

typedef Container dyno::priority_queue< T, Container, Compare >::container_type

Definition at line 45 of file PriorityQueue.h.

difference_type

template<typename T, typename Container = dyno::RandomAccessContainer<T>, typename Compare = dyno::less<typename Container::value_type>>

typedef Container::difference_type dyno::priority_queue< T, Container, Compare >::difference_type

Definition at line 52 of file PriorityQueue.h.

reference

template<typename T, typename Container = dyno::RandomAccessContainer<T>, typename Compare = dyno::less<typename Container::value_type>>

typedef Container::reference dyno::priority_queue< T, Container, Compare >::reference

Definition at line 49 of file PriorityQueue.h.

size_type

template<typename T, typename Container = dyno::RandomAccessContainer<T>, typename Compare = dyno::less<typename Container::value_type>>

typedef Container::size_type dyno::priority_queue< T, Container, Compare >::size_type

Definition at line 51 of file PriorityQueue.h.

this_type

template<typename T, typename Container = dyno::RandomAccessContainer<T>, typename Compare = dyno::less<typename Container::value_type>>

typedef priority_queue<T, Container, Compare> dyno::priority_queue< T, Container, Compare >::this_type

Definition at line 44 of file PriorityQueue.h.

value_type

template<typename T, typename Container = dyno::RandomAccessContainer<T>, typename Compare = dyno::less<typename Container::value_type>>

typedef Container::value_type dyno::priority_queue< T, Container, Compare >::value_type

Definition at line 48 of file PriorityQueue.h.

Constructor & Destructor Documentation

priority_queue() [1/4]

template<typename T, typename Container, typename Compare>

DYN_FUNC dyno::priority_queue< T, Container, Compare >::priority_queue ( )

inline

Definition at line 5 of file PriorityQueue.inl.

~priority_queue()

template<typename T, typename Container, typename Compare>

DYN_FUNC dyno::priority_queue< T, Container, Compare >::~priority_queue ( )

inline

Definition at line 12 of file PriorityQueue.inl.

priority_queue() [2/4]

template<typename T, typename Container, typename Compare>

DYN_FUNC dyno::priority_queue< T, Container, Compare >::priority_queue ( const container_type & c )

inlineexplicit

Definition at line 18 of file PriorityQueue.inl.

priority_queue() [3/4]

template<typename T, typename Container, typename Compare>

DYN_FUNC dyno::priority_queue< T, Container, Compare >::priority_queue ( const compare_type & compare )

inlineexplicit

Definition at line 25 of file PriorityQueue.inl.

priority_queue() [4/4]

template<typename T, typename Container, typename Compare>

DYN_FUNC dyno::priority_queue< T, Container, Compare >::priority_queue ( const container_type & c, const compare_type & compare )

inlineexplicit

Definition at line 32 of file PriorityQueue.inl.

Member Function Documentation

change()

template<typename T, typename Container, typename Compare>

DYN_FUNC void dyno::priority_queue< T, Container, Compare >::change ( size_type n )

inline

Definition at line 90 of file PriorityQueue.inl.

Here is the call graph for this function:

clear()

template<typename T, typename Container, typename Compare>

DYN_FUNC void dyno::priority_queue< T, Container, Compare >::clear ( )

inline

Definition at line 60 of file PriorityQueue.inl.

empty()

template<typename T, typename Container, typename Compare>

DYN_FUNC bool dyno::priority_queue< T, Container, Compare >::empty ( ) const

inline

Definition at line 41 of file PriorityQueue.inl.

isEmpty()

template<typename T, typename Container, typename Compare>

DYN_FUNC bool dyno::priority_queue< T, Container, Compare >::isEmpty ( ) const

inline

Definition at line 48 of file PriorityQueue.inl.

pop()

template<typename T, typename Container, typename Compare>

DYN_FUNC void dyno::priority_queue< T, Container, Compare >::pop ( )

inline

Definition at line 83 of file PriorityQueue.inl.

push()

template<typename T, typename Container, typename Compare>

DYN_FUNC void dyno::priority_queue< T, Container, Compare >::push ( const value_type & value )

inline

Definition at line 75 of file PriorityQueue.inl.

remove()

template<typename T, typename Container, typename Compare>

DYN_FUNC void dyno::priority_queue< T, Container, Compare >::remove ( size_type n )

inline

Definition at line 97 of file PriorityQueue.inl.

Here is the call graph for this function:

size()

template<typename T, typename Container, typename Compare>

DYN_FUNC priority_queue< T, Container, Compare >::size_type dyno::priority_queue< T, Container, Compare >::size ( ) const

inline

Definition at line 54 of file PriorityQueue.inl.

top()

template<typename T, typename Container, typename Compare>

DYN_FUNC priority_queue< T, Container, Compare >::const_reference dyno::priority_queue< T, Container, Compare >::top ( ) const

inline

Definition at line 68 of file PriorityQueue.inl.

Member Data Documentation

cmp

template<typename T, typename Container = dyno::RandomAccessContainer<T>, typename Compare = dyno::less<typename Container::value_type>>

compare_type dyno::priority_queue< T, Container, Compare >::cmp

private

Definition at line 57 of file PriorityQueue.h.

container

template<typename T, typename Container = dyno::RandomAccessContainer<T>, typename Compare = dyno::less<typename Container::value_type>>

container_type dyno::priority_queue< T, Container, Compare >::container

Definition at line 55 of file PriorityQueue.h.

---

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

• D:/Peridyno/peridyno/src/Core/STL/PriorityQueue.h
• D:/Peridyno/peridyno/src/Core/STL/PriorityQueue.inl