sortedPriorityQueue.h File Reference

Priority queues which can be parsed using iterators. More...

#include <cstddef>
#include <functional>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <agrum/agrum.h>
#include <agrum/base/core/priorityQueue.h>
#include <agrum/base/core/sharedAVLTree.h>
#include <initializer_list>
#include <type_traits>
#include <agrum/base/core/sortedPriorityQueue_tpl.h>

Include dependency graph for sortedPriorityQueue.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	gum::SortedPriorityQueue< Val, Priority, Cmp >
	A priority queue in which we can iterate over the elements from the top to bottom or conversely. More...
class	gum::SortedPriorityQueueIterator< Val, Priority, Cmp >
	Sorted priority queue iterator. More...
class	gum::SortedPriorityQueueIteratorSafe< Val, Priority, Cmp >
	Sorted priority queues safe (w.r.t. More...
class	gum::SortedPriorityQueueReverseIterator< Val, Priority, Cmp >
	Sorted priority queue reverse iterator. More...
class	gum::SortedPriorityQueueReverseIteratorSafe< Val, Priority, Cmp >
	Sorted priority queue safe (w.r.t. More...

Namespaces
namespace	gum
	gum is the global namespace for all aGrUM entities

Functions
template<typename Val, typename Priority, typename Cmp>
std::ostream &	gum::operator<< (std::ostream &stream, const SortedPriorityQueue< Val, Priority, Cmp > &queue)
	display the content of a sorted priority queue

Detailed Description

Priority queues which can be parsed using iterators.

Author

Christophe GONZALES(_at_AMU) and Pierre-Henri WUILLEMIN(_at_LIP6)

Definition in file sortedPriorityQueue.h.