std::priority_queue

 

C++

Idioma

Conceptos

Utilidades de la biblioteca

Strings biblioteca

Contenedores biblioteca

Algoritmos biblioteca

Los iteradores biblioteca

Numéricos biblioteca

Entrada / salida de la biblioteca

Localizaciones biblioteca

Expresiones biblioteca Regular (C++11)

Operaciones de biblioteca Atómica (C++11)

Tema Biblioteca de ayuda (C++11)

 

Contenedores 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

Las funciones miembro 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=

Elemento acceso 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

Capacidad 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

 

Defined in header <queue>
template<     class T,     class Container = std::vector<T>,     class Compare = std::less<typename Container::value_type> > class priority_queue;

Cola de prioridad es un contenedor que permite la máxima constante de tiempo (o mínimo, en función Compare) extracción a expensas de inserción logarítmica. Trabajar con un priority_queue es similar a la gestión de un montón en algunos contenedor de acceso aleatorio, con la ventaja de no ser capaz de invalidar accidentalmente el montón .

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 montón 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 miembros

Miembro de tipo 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

Las funciones miembro

(constructor)	construye el 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. (miembro público función)
(destructor)	destructs the priority_queue (miembro público función)
operator=	asigna valores al 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. (miembro público función)
Elemento acceso 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	acceder al 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. (miembro público función)
Capacidad 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	comprueba si el contenedor subyacente está vacía 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. (miembro público función)
size	devuelve el 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. (miembro público función)
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 (miembro público función)
emplace (C++11)	constructs element in-place and sorts the underlying container (miembro público función)
pop	elimina el primer 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. (miembro público función)
swap	intercambia los contenidos 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. (miembro público función)
Objetos miembros 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	el contenedor subyacente 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. (objetos protegidos miembro)
Compare comp	el objeto de la función de comparación 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. (objetos protegidos miembro)

Terceros funciones

std::swap(std::priority_queue)	el algoritmo se especializa 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. (función de plantilla)

Clases de ayuda

std::uses_allocator<std::priority_queue> (C++11)	se especializa el rasgo 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. (función de plantilla)