Varianti

    cpp/algorithm/partial sort: differenze tra le versioni

    Da cppreference.com.
    ← Differenza precedente
    P12bot (discussione | contributi)
    Bot
    111 718 modifiche
    m r2.7.3) (Bot: Aggiungo de, en, es, fr, ja, pt, zh
    P12bot (discussione | contributi)
    Bot
    111 718 modifiche
    m Use {{lc}}. Update links. Various fixes.
     
    Riga 2: Riga 2:
    {{cpp/title|partial_sort}}
    {{cpp/title|partial_sort}}
    {{cpp/algorithm/navbar}}
    {{cpp/algorithm/navbar}}
    {{ddcl list begin}}
    {{begin}}
    {{ddcl list header | algorithm}}
    {{header | algorithm}}
    {{ddcl list item | num=1 |
    {{| num=1 |
    template< class RandomIt >
    template< class RandomIt >
    void partial_sort( RandomIt first, RandomIt middle, RandomIt last );
    void partial_sort( RandomIt first, RandomIt middle, RandomIt last );
    }}
    }}
    {{ddcl list item | num=2 |
    {{| num=2 |
    template< class RandomIt, class Compare >
    template< class RandomIt, class Compare >
    void partial_sort( RandomIt first, RandomIt middle, RandomIt last, Compare comp );
    void partial_sort( RandomIt first, RandomIt middle, RandomIt last, Compare comp );
    }}
    }}
    {{ddcl list end}}
    {{end}}


    {{tr|Ordina alcuni degli elementi della {{tt|[first, last)}} intervallo in ordine crescente. La {{c|middle - first}} primo di questi elementi vengono inseriti nella {{tt|[first, middle)}} gamma. L'ordine degli elementi uguali non è garantito per essere preservato. L'ordine degli elementi rimanenti nella {{tt|[middle, last)}} campo non è specificato. La prima versione utilizza {{c|operator<}} di confrontare gli elementi, la seconda versione utilizza la funzione di confronto dato {{tt|comp}}.|Sorts some of the elements in the range {{tt|[first, last)}} in ascending order. The first {{c|middle - first}} of these elements are placed in the range {{tt|[first, middle)}}. The order of equal elements is not guaranteed to be preserved. The order of the remaining elements in the range {{tt|[middle, last)}} is unspecified. The first version uses {{c|operator<}} to compare the elements, the second version uses the given comparison function {{tt|comp}}.}}
    {{tr|Ordina alcuni degli elementi della {{tt|[first, last)}} intervallo in ordine crescente. La {{c|middle - first}} primo di questi elementi vengono inseriti nella {{tt|[first, middle)}} gamma. L'ordine degli elementi uguali non è garantito per essere preservato. L'ordine degli elementi rimanenti nella {{tt|[middle, last)}} campo non è specificato. La prima versione utilizza {{c|operator<}} di confrontare gli elementi, la seconda versione utilizza la funzione di confronto dato {{tt|comp}}.|Sorts some of the elements in the range {{tt|[first, last)}} in ascending order. The first {{c|middle - first}} of these elements are placed in the range {{tt|[first, middle)}}. The order of equal elements is not guaranteed to be preserved. The order of the remaining elements in the range {{tt|[middle, last)}} is unspecified. The first version uses {{c|operator<}} to compare the elements, the second version uses the given comparison function {{tt|comp}}.}}


    ===Parametri===
    ===Parametri===
    {{param list begin}}
    {{begin}}
    {{param list item | first, last |{{tr| la gamma di elementi da ordinare| the range of elements to sort}}}}
    {{| first, last |{{tr| la gamma di elementi da ordinare| the range of elements to sort}}}}
    {{param list cmp | comp | p1=RandomIt}}
    {{cmp | comp | p1=RandomIt}}
    {{param list hreq}}
    {{hreq}}
    {{param list req concept | RandomIt | RandomAccessIterator | ValueSwappable}}  
    {{req concept | RandomIt | RandomAccessIterator | ValueSwappable}}  
    {{param list req concept deref | RandomIt | MoveConstructible | MoveAssignable}}  
    {{req concept deref | RandomIt | MoveConstructible | MoveAssignable}}  
    {{param list end}}
    {{end}}


    ===Valore di ritorno===
    ===Valore di ritorno===
    Riga 54: Riga 54:


    ===Vedi anche===
    ===Vedi anche===
    {{dcl list begin}}
    {{begin}}
    {{dcl list template | cpp/algorithm/dcl list partial_sort_copy}}
    {{| cpp/algorithm/partial_sort_copy}}
    {{dcl list template | cpp/algorithm/dcl list stable_sort}}
    {{| cpp/algorithm/stable_sort}}
    {{dcl list template | cpp/algorithm/dcl list sort}}
    {{| cpp/algorithm/sort}}
    {{dcl list end}}
    {{end}}


    [[de:cpp/algorithm/partial sort]]
    [[de:cpp/algorithm/partial sort]]

    Versione attuale delle 19:23, 2 lug 2013

    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 RandomIt > void partial_sort( RandomIt first, RandomIt middle, RandomIt last );
    		 (1)
    template< class RandomIt, class Compare > void partial_sort( RandomIt first, RandomIt middle, RandomIt last, Compare comp );
    		 (2)
    Ordina alcuni degli elementi della [first, last) intervallo in ordine crescente. La middle - first primo di questi elementi vengono inseriti nella [first, middle) gamma. L'ordine degli elementi uguali non è garantito per essere preservato. L'ordine degli elementi rimanenti nella [middle, last) campo non è specificato. La prima versione utilizza operator< di confrontare gli elementi, la seconda versione utilizza la funzione di confronto dato comp.
    Original:
    Sorts some of the elements in the range [first, last) in ascending order. The first middle - first of these elements are placed in the range [first, middle). The order of equal elements is not guaranteed to be preserved. The order of the remaining elements in the range [middle, last) is unspecified. The first version uses operator< to compare the elements, the second version 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.

    Parametri

    first, last -
    la gamma di elementi da ordinare
    Original:
    the range of elements to sort
    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 ValueSwappable and RandomAccessIterator.
    -
    The type of dereferenced RandomIt must meet the requirements of MoveAssignable and MoveConstructible.

    Valore di ritorno

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

    Complessità

    O(N·log2(N)), in cui le applicazioni di N = std::distance(first, last) cmp. Se la memoria aggiuntiva è disponibile, la complessità è O(N·log(N))
    Original:
    O(N·log2(N)), where N = std::distance(first, last) applications of cmp. If additional memory is available, then the complexity is O(N·log(N))
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    Esempio

    #include <algorithm>
#include <functional>
#include <array>
#include <iostream>

int main()
{
    std::array<int, 10> s{5, 7, 4, 2, 8, 6, 1, 9, 0, 3};
  
    std::partial_sort(s.begin(), s.begin() + 3, s.end());
    for (int a : s) {
        std::cout << a << " ";
    } 
}

    Output: 

    0 1 2 7 8 6 5 9 4 3

    Vedi anche
    copie e parzialmente ordina una serie di elementi
    Original:
    copies and partially sorts a 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.

    (funzione di modello) [modifica]
    Ordina un intervallo di elementi, mantenendo ordine tra elementi uguali
    Original:
    sorts a range of elements while preserving order between equal elements
    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]
    ordina una serie in ordine crescente
    Original:
    sorts a range into ascending order
    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]