mn_biqueue.hpp File Reference

#include "../mn_config.hpp"
#include "../queue/mn_binaryqueue.hpp"
#include "../mn_algorithm.hpp"

Go to the source code of this file.

Classes
class	mn::container::basic_binary_queue_iterator< T >
class	mn::container::basic_binary_queue< T, TITEMSIZE >
	This queue can only hold one item. If sucessive push operations are called, that item is overwritten with whatever the last item was. More...

Namespaces
	mn
	mn::container

Typedefs
template<class T , mn::size_t TITEMSIZE = sizeof(T)>
using	mn::container::biqueue = basic_binary_queue< T >

Functions
template<class T , mn::size_t TITEMSIZE>
void	mn::container::swap (basic_binary_queue< T, TITEMSIZE > &a, basic_binary_queue< T, TITEMSIZE > &b)