std::priority_queue

 

C++

Linguaggio

Concetti

Libreria di Utilità

Stringhe

Contenitori

Algoritmi

Iteratori

Libreria matematca

Input/output

Localizzazione

Espressioni regolari (C++11)

Operazioni atomicche (C++11)

Multithreading (C++11)

 

Contenitori libreria

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

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

 

Defined in 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.

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
value_type	Container::value_type
size_type	Container::size_type
reference	Container::reference
const_reference	Container::const_reference

Membri funzioni

(constructor)	costruisce il 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. (metodo pubblico)
(destructor)	destructs the priority_queue (metodo pubblico)
operator=	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)
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.
top	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)
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.
empty	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)
size	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)
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.
push	inserts element and sorts the underlying container (metodo pubblico)
emplace (C++11)	constructs element in-place and sorts the underlying container (metodo pubblico)
pop	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)
swap	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)
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)
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)

Non membri funzioni

std::swap(std::priority_queue)	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)

Helper classi

std::uses_allocator<std::priority_queue> (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)