std::priority_queue::top

 

C++

Lenguaje

Cabeceras

Conceptos

Biblioteca de utilidades

Biblioteca de cadenas

Biblioteca de contenedores

Biblioteca de algoritmos

Biblioteca de iteradores

Biblioteca numérica

Biblioteca de entrada/salida

Biblioteca de localización

Biblioteca de expresiones regulares (C++11)

Biblioteca de operaciones atómicas (C++11)

Biblioteca de hilos/subprocesos (C++11)

 

Biblioteca de contenedores

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

 

const_reference top() const;

Devuelve referencia al elemento superior de la cola de prioridad. Este elemento se quitará en una llamada a pop(). Si la función por defecto comparación se utiliza, el elemento devuelto es también el más grande entre los elementos en la cola .

Original:

Returns reference to the top element in the priority queue. This element will be removed on a call to pop(). If default comparison function is used, the returned element is also the greatest among the elements in the queue.

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

Parámetros

(Ninguno)

Original:

(none)

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

Valor de retorno

Referencia al elemento superior como si se obtiene mediante una llamada a c.back() (desde C++11)

Original:

Reference to the top element as if obtained by a call to c.back() (desde C++11)

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

Referencia al elemento superior como si se obtiene mediante una llamada a c.front() (hasta C++11)

Original:

Reference to the top element as if obtained by a call to c.front() (hasta C++11)

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

Complejidad

Constante .

Original:

Constant.

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

Ver tambié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. (función miembro público)