Namespace
Varianti

std::priority_queue

Da cppreference.com.
< cpp‎ | container

Questa pagina è stata tradotta in modo automatico dalla versione in ineglese della wiki usando Google Translate.

La traduzione potrebbe contenere errori e termini strani. Muovi il puntatore sopra al testo per vedere la versione originale. Puoi aiutarci a correggere gli gli errori. Per ulteriori istruzioni clicca qui.

Click here for the English version of this page


 
C++
 
Contenitori libreria
 
std :: priority_queue
Membri funzioni
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 accesso
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
Capacità
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
Modificatori
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
 
Elemento definito nell'header <queue>
template<

    class T,
    class Container = std::vector<T>,
    class Compare = std::less<typename Container::value_type>

> class priority_queue;
Coda di priorità è un contenitore che permette la massima costante di tempo (o minimo, a seconda Compare) estrazione a scapito di inserimento logaritmica. Lavorando con una priority_queue è simile alla gestione di un heap in qualche contenitore accesso casuale, con il vantaggio di non essere in grado di invalidare accidentalmente mucchio.
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.

Indice

[modifica] Membri tipi

Membro 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 [modifica]
value_type Container::value_type [modifica]
size_type Container::size_type [modifica]
reference Container::reference [modifica]
const_reference Container::const_reference [modifica]

[modifica] Membri funzioni

 costruisce il priority_queue
(metodo pubblico) [modifica]
distrugge il priority_queue
(metodo pubblico) [modifica]
assegna valori all'adattatore contenitore
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.

(metodo pubblico) [modifica]
Elemento accesso
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.
accedere all'elemento superiore
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.

(metodo pubblico) [modifica]
Capacità
Original:
Capacity
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
verifica se il contenitore sottostante è vuoto
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.

(metodo pubblico) [modifica]
restituisce il numero di elementi
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.

(metodo pubblico) [modifica]
Modificatori
Original:
Modifiers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
 inserts element and sorts the underlying container
(metodo pubblico) [modifica]
(C++11)
 constructs element in-place and sorts the underlying container
(metodo pubblico) [modifica]
rimuove il primo 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.

(metodo pubblico) [modifica]
swap il contenuto
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.

(metodo pubblico) [modifica]

Membri oggetti
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
contenitore sottostante
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.

(attributo protetto) [modifica]
Compare comp
il confronto oggetto funzione
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.

(attributo protetto)

[modifica] Non membri funzioni
specializzata l'algoritmo 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.

(funzione di modello) [modifica]

[modifica] Helper classi

(C++11)
specializzata il tratto 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.

(funzione di modello) [modifica]
Estratto da "https://it.cppreference.com/mwiki/index.php?title=cpp/container/priority_queue&oldid=27317"