[ Web Proxy ]
URL:
Viewing: https://fr.cppreference.com/cpp/algorithm/make_heap [Back]  [Original]
std::make_heap cppreference.com
cppreference.com
Espaces de noms
Variantes

    std::make_heap

    De cppreference.com
    []

    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

    <metanoindex/>

     
    C++
     
    Bibliothque d'algorithmes
    Fonctions
    Original:
    Functions
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Non-modification de la squence des oprations
    Original:
    Non-modifying sequence operations
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Modification de la squence des oprations
    Original:
    Modifying sequence operations
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Des oprations de partitionnement
    Original:
    Partitioning operations
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Oprations de tri (sur les gammes tris)
    Original:
    Sorting operations (on sorted ranges)
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    is_sorted (C++11)
    is_sorted_until (C++11)
    sort
    Oprations binaires de recherche (sur les gammes tris)
    Original:
    Binary search operations (on sorted ranges)
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Dfinir les oprations (sur les gammes tris)
    Original:
    Set operations (on sorted ranges)
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Oprations Heap
    Original:
    Heap operations
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Minimum / maximum de fonctionnement
    Original:
    Minimum/maximum operations
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Oprations numriques
    Original:
    Numeric operations
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Bibliothque C
    Original:
    C library
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
     
    <tbody> </tbody>
    Dclar dans l'en-tte <algorithm>
    template< class RandomIt > void make_heap( RandomIt first, RandomIt last );
    		 (1)
    template< class RandomIt, class Compare > void make_heap( RandomIt first, RandomIt last, Compare comp );
    		 (2)
    Construit un tas' dans le [first, last) gamme. La premire version de la fonction utilise operator< de comparer les lments, la seconde utilise la fonction de comparaison donne comp .
    Original:
    Constructs a heap in the range [first, last). The first version of the function uses operator< to compare the elements, 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.

    Paramtres

    first, last -
    la plage d'lments pour faire le tas de
    Original:
    the range of elements to make the heap from
    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.
    -
    The type of dereferenced RandomIt must meet the requirements of MoveAssignable and MoveConstructible.

    Retourne la valeur

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

    Complexit

    la plupart des comparaisons 3*std::distance(first, last) .
    Original:
    At most 3*std::distance(first, last) comparisons.
    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'lments [f,l) qui a les proprits 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 lment de la srie
      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 lment 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 lment 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 relle des lments est dfini par l'implmentation .
    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';

    std::make_heap(v.begin(), v.end());

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

    std::pop_heap(v.begin(), v.end());
    auto largest = v.back();
    v.pop_back();
    std::cout << "largest element: " << largest << '\n';

    std::cout << "after removing the largest element, v: ";
    for (auto i : v) std::cout << i << ' ';
    std::cout << '\n';
}

    Rsultat : 

    initially, v: 3 1 4 1 5 9 
after make_heap, v: 9 5 4 1 1 3 
largest element: 9
after removing the largest element, v: 5 3 4 1 1

    Voir aussi
    transforme un tas dans une gamme d'lments tris
    Original:
    turns a heap into a sorted range of elements
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    (fonction gnrique) [edit]
    Web Proxy Viewer  |  New URL  |  Original Page