priorityQueue.h File Reference

priority queues (in which an element cannot appear more than once) More...

#include <functional>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <agrum/agrum.h>
#include <agrum/base/core/hashTable.h>
#include <initializer_list>
#include <type_traits>
#include <agrum/base/core/priorityQueue_tpl.h>

Include dependency graph for priorityQueue.h:

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

Go to the source code of this file.

Classes
class	gum::PriorityQueueImplementation< Val, Priority, Cmp, Gen >
	The internal class for representing priority queues. More...
class	gum::PriorityQueue< Val, Priority, Cmp >
	A priorityQueue is a heap in which each element has a mutable priority. More...

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

Macros
#define	GUM_PRIORITY_QUEUE_DEFAULT_CAPACITY   10

Functions
template<typename Val, typename Priority, typename Cmp>
std::ostream &	gum::operator<< (std::ostream &, const PriorityQueue< Val, Priority, Cmp > &)

Detailed Description

priority queues (in which an element cannot appear more than once)

Author

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

Definition in file priorityQueue.h.

Macro Definition Documentation

GUM_PRIORITY_QUEUE_DEFAULT_CAPACITY

#define GUM_PRIORITY_QUEUE_DEFAULT_CAPACITY   10

Definition at line 68 of file priorityQueue.h.

Referenced by gum::SortedPriorityQueue< Val, Priority, Cmp >::SortedPriorityQueue().