Queue.hpp File Reference

#include "Deque.hpp"
#include "Vector.hpp"
#include <queue>

Go to the source code of this file.

Namespaces
namespace	CeresEngine

Typedefs
template<typename T , typename Container = Deque<T>>
using	CeresEngine::Queue = std::queue< T, Container >
	The Queue class is a container adapter that gives the programmer the functionality of a queue - specifically, a FIFO (first-in, first-out) data structure.
template<typename T , typename Container = Vector<T>, typename Compare = std::less<>>
using	CeresEngine::PriorityQueue = std::priority_queue< T, Container, Compare >
	A PriorityQueue is a container adaptor that provides constant time lookup of the largest (by default) element, at the expense of logarithmic insertion and extraction.