Espaces de noms
Variantes
Affichages
Actions

std::priority_queue

De cppreference.com
< cpp‎ | container

This page has been machine-translated from the English version of the wiki using Google Translate.

The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here.

Click here for the English version of this page


 
C++
 
Bibliothèque de conteneurs
 
std :: priority_queue
Les fonctions membres
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=
Elément d'accès
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
Modificateurs
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
 
Déclaré dans l'en-tête <queue>
template<

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

> class priority_queue;
File d'attente de priorité est un conteneur qui permet de constante de temps maximale (ou minimale, en fonction de Compare) extraction au détriment de l'insertion logarithmique. Travailler avec un priority_queue est similaire à la gestion d'un tas dans certains conteneurs à accès aléatoire, avec l'avantage de ne pas être en mesure d'invalider accidentellement le tas .
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 tas 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.

Sommaire

[modifier] Types de membres

Type du membre Définition
container_type Container [edit]
value_type Container::value_type [edit]
size_type Container::size_type