std::priority_queue

 

C++

Язык

Понятия (концепции)

Утилиты

Строки

Контейнеры

Алгоритмы

Итераторы

Работа с числами

Ввод / вывод

Локализация

Регулярные выражения (C++11)

Атомарные примитивы (C++11)

Потоки (C++11)

 

Контейнеры

array (C++11)

vector

deque

forward_list (C++11)

list

set

multiset

map

multimap

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

stack

queue

priority_queue

 

зЬй :: priority_queue

Член функций Original: Member functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

priority_queue::priority_queue

priority_queue::~priority_queue

priority_queue::operator=

Элемент доступа Original: Element access The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

priority_queue::top

Потенциала Original: Capacity The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

priority_queue::empty

priority_queue::size

Модификаторы Original: Modifiers The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

priority_queue::push

priority_queue::emplace

priority_queue::pop

priority_queue::swap

 

Заголовочный файл <queue>
template<     class T,     class Container = std::vector<T>,     class Compare = std::less<typename Container::value_type> > class priority_queue;

Приоритетные очереди является контейнером, который позволяет постоянное максимальное время (или минимальные, в зависимости от Compare) добыча за счет логарифмического вставки. Работа с priority_queue похоже на управление куча в некоторых случайных контейнеров доступа, благо не в состоянии случайно недействительным кучи.

Original:

Priority queue is a container that allows for constant time maximum (or minimum, depending on Compare) extraction at the expense of logarithmic insertion. Working with a priority_queue is similar to managing a куча in some random access container, with the benefit of not being able to accidentally invalidate the heap.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Член типов

Член типа Original: Member type The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.	Definition
container_type	Container
value_type	Container::value_type
size_type	Container::size_type
reference	Container::reference
const_reference	Container::const_reference

Член функций

(constructor)	строит priority_queue Original: constructs the priority_queue The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (public функция-член)
(destructor)	destructs the priority_queue (public функция-член)
operator=	Шаблон:tlist frontr (public функция-член)
Элемент доступа Original: Element access The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
top	доступ к верхнему элементу Original: access the top element The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (public функция-член)
Потенциала Original: Capacity The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
empty	проверяет отсутствие элементов в контейенре, используемом для реализации (public функция-член)
size	возвращает количество элементов Original: returns the number of elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (public функция-член)
Модификаторы Original: Modifiers The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
push	вставляет элемент и сортирует базовый контейнер (public функция-член)
emplace (C++11)	конструирует элемент "на месте" и сортирует базовый контейнер (public функция-член)
pop	удаляет первый элемент Original: removes the first element The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (public функция-член)
swap	обмениевает содержимое (public функция-член)
Член объектов Original: Member objects The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Container c	базового контейнера Original: the underlying container The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (protected объект-член)
Compare comp	объект функции сравнения Original: the comparison function object The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (protected объект-член)

Не являющиеся членами функций

std::swap(std::priority_queue)	Специализируется std::swap алгоритм Original: specializes the std::swap algorithm The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (шаблон функции)

Вспомогательные классы

std::uses_allocator<std::priority_queue> (C++11)	Специализируется черта std::uses_allocator типа Original: specializes the std::uses_allocator type trait The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (шаблон функции)