std::iota

 

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)

 

Algoritmo biblioteca

Funciones Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Para no modificar la secuencia de las operaciones 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.
all_of any_of none_of (C++11) (C++11) (C++11) for_each count count_if mismatch equal	find find_if find_if_not (C++11) find_end find_first_of adjacent_find search search_n
Modificación de la secuencia de operaciones 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.
copy copy_if (C++11) copy_n (C++11) copy_backward move (C++11) move_backward (C++11) fill fill_n transform generate generate_n remove remove_if remove_copy remove_copy_if	replace replace_if replace_copy replace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffle shuffle   (C++11) unique unique_copy
Particionamiento operaciones 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.
is_partitioned (C++11) partition partition_copy (C++11)	stable_partition partition_point (C++11)
Clasificación de las operaciones (en rangos ordenados) 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	partial_sort partial_sort_copy stable_sort nth_element
Las operaciones binarias de búsqueda (en rangos ordenados) 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.
lower_bound upper_bound	binary_search equal_range
Conjunto de operaciones (en rangos ordenados) 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.
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
Operaciones del montón 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.
is_heap is_heap_until (C++11) make_heap	push_heap pop_heap sort_heap
Mínimo / máximo de operaciones 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.
max max_element min min_element minmax (C++11) minmax_element (C++11)	lexicographical_compare is_permutation (C++11) next_permutation prev_permutation
Operaciones numéricas 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.
iota (C++11) accumulate inner_product	adjacent_difference partial_sum
C biblioteca 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.
qsort	bsearch

 

Defined in header <numeric>
template< class ForwardIterator, class T > void iota( ForwardIterator first, ForwardIterator last, T value );		(ya que C + +11)

Rellena el [first, last) rango con valores crecientes de forma secuencial, comenzando con value y repetitiva evaluar ++value .

Original:

Fills the range [first, last) with sequentially increasing values, starting with value and repetitively evaluating ++value.

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

Equivalente operación:

Original:

Equivalent operation:

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

*(d_first)   = value;
*(d_first+1) = ++value;
*(d_first+2) = ++value;
*(d_first+3) = ++value;
...

Parámetros

first, last	-	el intervalo de elementos de suma Original: the range of elements to sum The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
value	-	valor inicial a la tienda, la expresión + valor + debe estar bien formado Original: initial value to store, the expression ++value must be well-formed The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

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.

Complejidad

Exactamente last - first incrementos y asignaciones .

Original:

Exactly last - first increments and assignments.

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

Posible implementación

template<class ForwardIterator, class T> void iota(ForwardIterator first, ForwardIterator last, T value) { while(first != last) { *first++ = value; ++value; } }

Ejemplo

El siguiente ejemplo se aplica a un vector std::random_shuffle de los iteradores para una std::list desde std::random_shuffle no se puede aplicar a un std::list directamente. std::iota se utiliza para crear el vector .

Original:

The following example applies std::random_shuffle to a vector of iterators to a std::list since std::random_shuffle cannot be applied to an std::list directly. std::iota is used to create the vector.

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

#include <numeric>
#include <algorithm>
#include <list>
#include <vector>
#include <iostream>
 
int main()
{
    std::list<int> l(10);
    std::iota(l.begin(), l.end(), -4);
 
    std::vector<std::list<int>::iterator> v(l.size());
    std::iota(v.begin(), v.end(), l.begin());
 
    std::random_shuffle(v.begin(), v.end());
 
    std::cout << "Contents of the list: ";
    for(auto n: l) {
        std::cout << n << ' ';
    }
    std::cout << '\n';
 
    std::cout << "Contents of the list, shuffled: ";
    for(auto i: v) {
        std::cout << *i << ' ';
    }
    std::cout << '\n';
}

Output:

Contents of the list: -4 -3 -2 -1 0 1 2 3 4 5
Contents of the list, shuffled: 0 -1 3 4 -4 1 -2 -3 2 5

Ver también

fill	asigna una serie de elementos de un cierto valor Original: assigns a range of elements a certain value The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (función de plantilla)
generate	guarda el resultado de una función en un intervalo Original: saves the result of a function in a range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (función de plantilla)