Varianti

    std::is_sorted

    Da cppreference.com.

    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

    <metanoindex/>

     
    C++
     
    Algoritmo libreria
    Funzioni
    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 modifica le operazioni di sequenza
    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.
    Modifica delle operazioni di sequenza
    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.
    Partizionamento operazioni
    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.
    Ordinamento delle operazioni (su intervalli ordinati)
    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.
    Binarie (le operazioni di ricerca sui campi ordinati)
    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.
    Impostare le operazioni (su intervalli ordinati)
    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.
    Heap operazioni
    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.
    Minimo / massimo le operazioni
    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.
    Operazioni numeriche
    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.
    Libreria 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>
    Elemento definito nell'header <algorithm>
    template< class ForwardIt > bool is_sorted( ForwardIt first, ForwardIt last );
    		 (1) (dal C++11)
    template< class ForwardIt, class Compare > bool is_sorted( ForwardIt first, ForwardIt last, Compare comp );
    		 (2) (dal C++11)

    Checks if the elements in range [first, last) are sorted in ascending order. The first version of the function uses operator< to compare the elements, the second uses the given comparison function comp.

    Parametri

    first, last -
    la gamma di elementi da esaminare
    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 ForwardIt can be dereferenced and then implicitly converted to both of them. ​

    Type requirements
    -
    ForwardIt must meet the requirements of ForwardIterator.

    Valore di ritorno

    true if the elements in the range are sorted in ascending order

    Complessità

    lineare la distanza tra first e 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.

    Possibile implementazione

    First version 
    template<class ForwardIt>
bool is_sorted(ForwardIt first, ForwardIt last)
{
    return std::is_sorted_until(first, last) == last;
}
    Second version 
    template<class ForwardIt, class Compare>
bool is_sorted(ForwardIt first, ForwardIt last, Compare comp)
{
    return std::is_sorted_until(first, last, comp) == last;
}

    Esempio

    #include <iostream>
#include <algorithm>

int main() 
{
    const int N = 5;
    int digits[N] = {3, 1, 4, 1, 5};

    for (auto i : digits) std::cout << i << ' ';
    std::cout << ": is_sorted: " << std::is_sorted(digits, digits+N) << '\n';

    std::sort(digits, digits+N);

    for (auto i : digits) std::cout << i << ' ';
    std::cout << ": is_sorted: " << std::is_sorted(digits, digits+N) << '\n';
}

    Output: 

    3 1 4 1 5 : is_sorted: 0
1 1 3 4 5 : is_sorted: 1

    Vedi anche

    (C++11)
    trova il più grande subrange ordinato
    Original:
    finds the largest sorted subrange
    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]