priority_queue.h File Reference

#include "di/container/action/sequence.h"
#include "di/container/action/to.h"
#include "di/container/algorithm/make_heap.h"
#include "di/container/algorithm/pop_heap.h"
#include "di/container/algorithm/push_heap.h"
#include "di/container/concepts/prelude.h"
#include "di/container/iterator/iterator_base.h"
#include "di/container/meta/prelude.h"
#include "di/container/vector/vector.h"
#include "di/util/deduce_create.h"
#include "di/vocab/optional/prelude.h"

Go to the source code of this file.

Classes
class	di::container::PriorityQueue< Value, Con, Comp >
class	di::PriorityQueue< Value, Con, Comp >

Namespaces
namespace	di
namespace	di::container
namespace	di::container::detail

Concepts
concept	di::container::detail::PriorityQueueCompatible

Functions
template<concepts::Container Con, typename T = meta::ContainerValue<Con>, concepts::StrictWeakOrder< T > Comp> requires (detail::PriorityQueueCompatible<Con, T>)
	di::container::PriorityQueue (Comp, Con) -> PriorityQueue< T, Con, Comp >
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>>
auto	di::container::tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< PriorityQueue >, Con &&) -> PriorityQueue< T >
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>, concepts::StrictWeakOrder< T > Comp>
auto	di::container::tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< PriorityQueue >, Con &&, Comp) -> PriorityQueue< T, container::Vector< T >, Comp >