priorityQueue.h File Reference

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

#include <functional>
#include <initializer_list>
#include <sstream>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
#include <agrum/agrum.h>
#include <agrum/core/hashTable.h>
#include <agrum/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::PriorityQueue< Val, Priority, Cmp, Alloc >
	A priorityQueue is a heap in which each element has a mutable priorityA priority queue is quite similar to a heap except that a priority (a score) is assigned to each element in the structure. More...
class	gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >
	The internal class for representing priority queues. More...
class	gum::PriorityQueue< Val, Priority, Cmp, Alloc >
	A priorityQueue is a heap in which each element has a mutable priorityA priority queue is quite similar to a heap except that a priority (a score) is assigned to each element in the structure. More...

Namespaces
	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 , typename Alloc >
std::ostream &	gum::operator<< (std::ostream &, const PriorityQueue< Val, Priority, Cmp, Alloc > &)

Detailed Description

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

Author

Christophe GONZALES and Pierre-Henri WUILLEMIN

Definition in file priorityQueue.h.

Macro Definition Documentation

GUM_PRIORITY_QUEUE_DEFAULT_CAPACITY

#define GUM_PRIORITY_QUEUE_DEFAULT_CAPACITY   10

Definition at line 44 of file priorityQueue.h.