priority_deque.h File Reference

#include <nvbio/basic/types.h>
#include <nvbio/basic/interval_heap.h>
#include <functional>
#include <vector>

Go to the source code of this file.

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

Namespaces
	nvbio
	Define a vector_view POD type and plain_view() for std::vector.

Functions
template<typename Type , typename Sequence , typename Compare >
void	nvbio::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.h.