std::is_heap — cppreference.com

De cppreference.com

Déclaré dans l'en-tête `<algorithm>`
`template< class RandomIt > bool is_heap( RandomIt first, RandomIt last );`	(1)
`template< class RandomIt, class Compare > bool is_heap( RandomIt first, RandomIt last, Compare comp );`	(2)

Vérifie si les éléments de la gamme sont [first, last) un tas' .

Original:

Checks if the elements in range [first, last) are a heap.

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

La première version de is_heap utilise operator< de comparer des éléments, tandis que la seconde utilise la fonction de comparaison donnée comp .

Original:

The first version of is_heap uses operator< to compare elements, whereas the second uses the given comparison function comp.

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

Paramètres

first, last	-	l'éventail des éléments à examiner Original: the range of elements to examine The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
comp	-	comparison function which returns `true` if the first argument is less than the second. The signature of the comparison function should be equivalent to the following: `bool cmp(const Type1 &a, const Type2 &b);` The signature does not need to have `const &`, but the function must not modify the objects passed to it. The types `Type1` and `Type2` must be such that an object of type `RandomIt` can be dereferenced and then implicitly converted to both of them.
Type requirements
-`RandomIt` must meet the requirements of `RandomAccessIterator`.

Retourne la valeur

true si la plage est tas', false autrement .

Original:

true if the range is heap, false otherwise.

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

Complexité

Linéaire de la distance entre first et last

Original:

Linear in the distance between first and last

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

Notes

Un tas' est un ensemble d'éléments [f,l) qui a les propriétés suivantes:

Original:

A heap is a range of elements [f,l) that has the following properties:

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

*f est le plus grand élément de la série
Original:
*f is the largest element in the range
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
un nouvel élément peut être ajouté à l'aide std::push_heap()
Original:
a new element can be added using std::push_heap()
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
le premier élément peut être retiré à l'aide std::pop_heap()
Original:
the first element can be removed using std::pop_heap()
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

La disposition réelle des éléments est défini par l'implémentation .

Original:

The actual arrangement of the elements is implementation defined.

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

Exemple

#include <iostream>
#include <algorithm>

int main()
{
    std::vector<int> v { 3, 1, 4, 1, 5, 9 };

    std::cout << "initially, v: ";
    for (auto i : v) std::cout << i << ' ';
    std::cout << '\n';

    if (!std::is_heap(v.begin(), v.end())) {
        std::cout << "making heap...\n";
        std::make_heap(v.begin(), v.end());
    }

    std::cout << "after make_heap, v: ";
    for (auto i : v) std::cout << i << ' ';
    std::cout << '\n';
}

Résultat :

initially, v: 3 1 4 1 5 9 
making heap...
after make_heap, v: 9 5 4 1 1 3

Voir aussi


	trouve le plus grand sous-plage qui est tas Original: finds the largest subrange that is heap The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction générique) [edit]