Iteration Support

Functions
iterator	sparta::PriorityQueue< DataT, SortingAlgorithmT, bounded_cnt >::begin ()
	Iterator to beginning of the queue – highest priority.
const_iterator	sparta::PriorityQueue< DataT, SortingAlgorithmT, bounded_cnt >::begin () const
	Const Iterator to beginning of the queue – highest priority.
iterator	sparta::PriorityQueue< DataT, SortingAlgorithmT, bounded_cnt >::end ()
	Iterator to end of the queue – end priority.
const_iterator	sparta::PriorityQueue< DataT, SortingAlgorithmT, bounded_cnt >::end () const
	Const Iterator to end of the queue – end priority.

Detailed Description

Function Documentation

begin() [1/2]

template<class DataT , class SortingAlgorithmT = std::less<DataT>, size_t bounded_cnt = 0>

iterator sparta::PriorityQueue< DataT, SortingAlgorithmT, bounded_cnt >::begin ( )

inline

Iterator to beginning of the queue – highest priority.

Definition at line 168 of file PriorityQueue.hpp.

begin() [2/2]

template<class DataT , class SortingAlgorithmT = std::less<DataT>, size_t bounded_cnt = 0>

const_iterator sparta::PriorityQueue< DataT, SortingAlgorithmT, bounded_cnt >::begin ( ) const

inline

Const Iterator to beginning of the queue – highest priority.

Definition at line 171 of file PriorityQueue.hpp.

end() [1/2]

template<class DataT , class SortingAlgorithmT = std::less<DataT>, size_t bounded_cnt = 0>

iterator sparta::PriorityQueue< DataT, SortingAlgorithmT, bounded_cnt >::end ( )

inline

Iterator to end of the queue – end priority.

Definition at line 174 of file PriorityQueue.hpp.

end() [2/2]

template<class DataT , class SortingAlgorithmT = std::less<DataT>, size_t bounded_cnt = 0>

const_iterator sparta::PriorityQueue< DataT, SortingAlgorithmT, bounded_cnt >::end ( ) const

inline

Const Iterator to end of the queue – end priority.

Definition at line 177 of file PriorityQueue.hpp.