priority_deque.hpp File Reference

#include <functional>
#include <vector>
#include "interval_heap.hpp"

Go to the source code of this file.

Classes
class	boost::container::priority_deque< Type, Sequence, Compare >
	Efficient double-ended priority queue. More...
class	boost::container::priority_deque< Type, Sequence, Compare >
	Efficient double-ended priority queue. More...

Namespaces
	boost
	boost::container

Macros
#define	BOOST_CONTAINER_PRIORITY_DEQUE_ASSERT(x, m)

Functions
template<typename Type , typename Sequence , typename Compare >
void	boost::container::swap (priority_deque< Type, Sequence, Compare > &deque1, priority_deque< Type, Sequence, Compare > &deque2)
	Swaps the elements of two priority deques. More...

Detailed Description

priority_deque.hpp provides the class priority_deque as a thin wrapper around the functions provided by interval_heap.hpp.

Remarks

Exception-safety: If the means of movement – move, copy, or swap, depending on exception specifications – do not throw, the guarantee is as strong as that of the action on the underlying container. (Unless otherwise specified)

Note

Providing a stronger guarantee is impractical.

Definition in file priority_deque.hpp.

Macro Definition Documentation

#define BOOST_CONTAINER_PRIORITY_DEQUE_ASSERT	(		x,
			m
	)

Definition at line 41 of file priority_deque.hpp.