std::list::sort

<metanoindex/>

 

C++

Sprache

Concepts

Utilities-Bibliothek

Strings Bibliothek

Container-Bibliothek

Algorithmen-Bibliothek

Iteratoren Bibliothek

Numerik-Bibliothek

Input / Output-Bibliothek

Lokalisierungen Bibliothek

Reguläre Ausdrücke Bibliothek (C++11)

Atomare Operationen Bibliothek (C++11)

Thread Support-Bibliothek (C++11)

 

Container-Bibliothek

array (C++11)

vector

deque

forward_list (C++11)

list

set

multiset

map

multimap

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

stack

queue

priority_queue

 

std::list

Member-Funktionen 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.

list::list

list::~list

list::operator=

list::assign

list::get_allocator

Elementzugriff zerstört 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.

list::front

list::back

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

list::begin list::cbegin (C++11)

list::end list::cend (C++11)

list::rbegin list::crbegin (C++11)

list::rend list::crend (C++11)

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

list::empty

list::size

list::max_size

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

list::clear

list::insert

list::emplace (C++11)

list::erase

list::push_front

list::emplace_front (C++11)

list::pop_front

list::push_back

list::emplace_back (C++11)

list::pop_back

list::resize

list::swap

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

list::merge

list::splice

list::remove list::remove_if

list::reverse

list::unique

list::sort

 

<tbody> </tbody>

void sort();	(1)
template< class Compare > void sort( Compare comp );	(2)

Sortiert die Elemente in aufsteigender Reihenfolge. Die Reihenfolge der gleiche Elemente garantiert erhalten. Die erste Version verwendet operator< um die Elemente zu vergleichen, verwendet die zweite Version des gegebenen Vergleichsfunktion comp. Die Reihenfolge der äquivalente Elemente erhalten bleibt .

Original:

Sorts the elements in ascending order. The order of equal elements is guaranteed to be preserved. The first version uses operator< to compare the elements, the second version uses the given comparison function comp. The ordering of equivalent elements is preserved.

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

Parameter

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 list<T,Allocator>::const_iterator can be dereferenced and then implicitly converted to both of them. ​

Rückgabewert

(None)

Original:

(none)

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

Beispiel

#include <iostream>
#include <functional>
#include <list>

std::ostream& operator<<(std::ostream& ostr, const std::list<int>& list)
{
    for (auto &i : list) {
        ostr << " " << i;
    }
    return ostr;
}

int main()
{
    std::list<int> list = { 8,7,5,9,0,1,3,2,6,4 };

    std::cout << "before:     " << list << "\n";
    list.sort();
    std::cout << "ascending:  " << list << "\n";
    list.sort(std::greater<int>());
    std::cout << "descending: " << list << "\n";
}

Output:

before:      8 7 5 9 0 1 3 2 6 4
ascending:   0 1 2 3 4 5 6 7 8 9
descending:  9 8 7 6 5 4 3 2 1 0

Komplexität

N · log(N) Vergleiche, wo N ist die Größe des Behälters .

Original:

N · log(N) comparisons, where N is the size of the container.

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