di::container::detail::PriorityQueueCompatible Concept Reference

#include <di/container/queue/priority_queue.h>

Concept definition

template<typename Con, typename Value>
concept di::container::detail::PriorityQueueCompatible = 
        concepts::RandomAccessContainer<Con> && concepts::Permutable<meta::ContainerIterator<Con>> &&
        concepts::SameAs<Value, meta::ContainerValue<Con>> && requires(Con& container, Value&& value) {
            { container.front() } -> concepts::SameAs<Optional<Value&>>;
            { util::as_const(container).front() } -> concepts::SameAs<Optional<Value const&>>;
            container.emplace_back(util::move(value));
            { container.pop_back() } -> concepts::SameAs<Optional<Value>>;
            { container.size() } -> concepts::UnsignedInteger;
        }