std::forward_list::sort

 

C++

Idioma

Conceptos

Utilidades de la biblioteca

Strings biblioteca

Contenedores biblioteca

Algoritmos biblioteca

Los iteradores biblioteca

Numéricos biblioteca

Entrada / salida de la biblioteca

Localizaciones biblioteca

Expresiones biblioteca Regular (C++11)

Operaciones de biblioteca Atómica (C++11)

Tema Biblioteca de ayuda (C++11)

 

Contenedores biblioteca

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::forward_list

Las funciones miembro 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.

forward_list::forward_list

forward_list::~forward_list

forward_list::operator=

forward_list::assign

forward_list::get_allocator

Elemento acceso 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.

forward_list::front

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

forward_list::before_begin forward_list::cbefore_begin

forward_list::begin forward_list::cbegin

forward_list::end forward_list::cend

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

forward_list::empty

forward_list::max_size

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

forward_list::clear

forward_list::insert_after

forward_list::emplace_after

forward_list::erase_after

forward_list::push_front

forward_list::emplace_front

forward_list::pop_front

forward_list::resize

forward_list::swap

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

forward_list::merge

forward_list::splice_after

forward_list::remove forward_list::remove_if

forward_list::reverse

forward_list::unique

forward_list::sort

 

void sort();	(1)	(ya que C + +11)
template< class Compare > void sort( Compare comp );	(2)	(ya que C + +11)

Ordena los elementos en orden ascendente. El orden de los elementos iguales se garantiza que se conservan. La primera versión utiliza operator< para comparar los elementos, la segunda versión utiliza la comparación comp función dada. El orden de los elementos equivalentes se conserva .

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.

Parámetros

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

Valor de retorno

(Ninguno)

Original:

(none)

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

Ejemplo

#include <iostream>
#include <functional>
#include <forward_list>
 
std::ostream& operator<<(std::ostream& ostr, const std::forward_list<int>& list)
{
    for (auto &i : list) {
        ostr << " " << i;
    }
    return ostr;
}
 
int main()
{
    std::forward_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

Complejidad

N · log(N) comparaciones, donde N es el tamaño del recipiente .

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.