std::partial_sum

 

C++

Lenguaje

Cabeceras

Conceptos

Biblioteca de utilidades

Biblioteca de cadenas

Biblioteca de contenedores

Biblioteca de algoritmos

Biblioteca de iteradores

Biblioteca numérica

Biblioteca de entrada/salida

Biblioteca de localización

Biblioteca de expresiones regulares(C++11)

Biblioteca de operaciones atómicas(C++11)

Biblioteca de tareas/subprocesos(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 InputIt, class OutputIt > OutputIt partial_sum( InputIt first, InputIt last, OutputIt d_first );	(1)
template<class InputIt, class OutputIt, class BinaryOperation > OutputIt partial_sum( InputIt first, InputIt last, OutputIt d_first,                       BinaryOperation op );	(2)

Calcula las sumas parciales de los elementos en los subintervalos del intervalo [first, last) y los escribe en el comienzo rango en d_first. La primera versión utiliza operator+ resumir los elementos, la segunda versión utiliza la función binaria dado op .

Original:

Computes the partial sums of the elements in the subranges of the range [first, last) and writes them to the range beginning at d_first. The first version uses operator+ to sum up the elements, the second version uses the given binary function op.

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)=*first;*(d_first+1)=*first +*(first+1);*(d_first+2)=*first +*(first+1)+*(first+2);*(d_first+3)=*first +*(first+1)+*(first+2)+*(first+3); ...

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.
d_first	-	el comienzo del rango de destino Original: the beginning of the destination range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
op	-	binary operation function object that will be applied. The signature of the function should be equivalent to the following:  Ret fun(const Type1 &a, const Type2 &b); The signature does not need to have const&. The type  Type1 must be such that an object of type iterator_traits<InputIt>::value_type can be implicitly converted to  Type1. The type  Type2 must be such that an object of type InputIt can be dereferenced and then implicitly converted to  Type2. The type  Ret must be such that an object of type iterator_traits<InputIt>::value_type can be assigned a value of type  Ret. ​
Type requirements
- InputIt must meet the requirements of InputIterator.
- OutputIt must meet the requirements of OutputIterator.

Valor de retorno

Iterator al elemento más allá del último elemento escrito .

Original:

Iterator to the element past the last element written.

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) - 1 aplicaciones de la operación binaria

Original:

Exactly (last - first) - 1 applications of the binary operation

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

First version
template<class InputIt, class OutputIt> OutputIt partial_sum(InputIt first, InputIt last, OutputIt d_first){return std::partial_sum(first, last, d_first, std::plus<InputIt, InputIt>());}
Second version
template<class InputIt, class OutputIt, class BinaryOperator> OutputIt partial_sum(InputIt first, InputIt last, OutputIt d_first, BinaryOperation op){if(first == last)return d_first;   typenamestd::iterator_traits<InputIt>::value_type sum =*first;*d_first = sum;   while(++first != last){ sum = op(sum, *first);*++d_first = sum;}return++d_first;}

Ejemplo

#include <numeric>#include <vector>#include <iostream>#include <iterator>#include <functional>int main(){std::vector<int> v ={2,2,2,2,2,2,2,2,2,2};   std::cout<<"The first 10 even numbers are: "; std::partial_sum(v.begin(), v.end(), std::ostream_iterator<int>(std::cout, " "));std::cout<<'\n';   std::partial_sum(v.begin(), v.end(), v.begin(), std::multiplies<int>());std::cout<<"The first 10 powers of 2 are: ";for(auto n: v){std::cout<< n <<" ";}std::cout<<'\n';}

Output:

The first 10 even numbers are: 2 4 6 8 10 12 14 16 18 20 The first 10 powers of 2 are: 2 4 8 16 32 64 128 256 512 1024

Ver también

adjacent_difference	calcula las diferencias entre elementos adyacentes en un rango Original: computes the differences between adjacent elements 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)
accumulate	resume una serie de elementos Original: sums up 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. (función de plantilla)