std::priority_queue

 

C++

Linguagem

Conceitos

Biblioteca de utilitários

Biblioteca cordas

Recipientes biblioteca

Biblioteca algoritmos

Biblioteca iteradores

Biblioteca numéricos

De entrada / saída da biblioteca

Biblioteca localizações

Biblioteca de expressões regulares (C++11)

Biblioteca operações atômica (C++11)

Biblioteca de suporte a discussão (C++11)

 

Recipientes biblioteca

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

 

std :: priority_queue

Funções de membro 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=

acesso. Elemento 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

Capacidade 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

Modificadores 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

 

Definido no cabeçalho <queue>
template<     class T,     class Container = std::vector<T>,     class Compare = std::less<typename Container::value_type> > class priority_queue;

Fila de prioridade é um recipiente que permite a máxima constante de tempo (ou menos, dependendo Compare) extracção em detrimento da inserção logarítmica. Trabalhando com um priority_queue é semelhante ao de um recipiente de algum heap acesso aleatório, com a vantagem de não ser capaz de invalidar acidentalmente a pilha.

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 heap 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.

Tipos de membro

Tipo de membro 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

Funções de membro

(constructor)	constrói o 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. (função pública membro)
(destructor)	destructs the priority_queue (função pública membro)
operator=	atribui valores ao adaptador de recipiente Original: assigns values to the container adaptor The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (função pública membro)
acesso. Elemento 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	acessar o elemento superior 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. (função pública membro)
Capacidade 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	verifica se o recipiente subjacente está vazio Original: checks whether the underlying container is empty The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (função pública membro)
size	devolve o número de elementos 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. (função pública membro)
Modificadores 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	inserts element and sorts the underlying container (função pública membro)
emplace (C++11)	constructs element in-place and sorts the underlying container (função pública membro)
pop	remove o primeiro elemento 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. (função pública membro)
swap	Trocar o conteúdo Original: swaps the contents The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (função pública membro)
Objetos Membros 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	o recipiente subjacente 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. (objeto protegido membro)
Compare comp	o objeto função de comparação 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. (objeto protegido membro)

Não-membros funções

std::swap(std::priority_queue)	o algoritmo especializado 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. (modelo de função)

Classes auxiliares

std::uses_allocator<std::priority_queue> (C++11)	especializa o traço tipo 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. (modelo de função)