Illustrating the generic accumulate algorithm with predicate : accumulate « STL Algorithms Helper « C++ Tutorial

1.	Language Basics
2.	Data Types
3.	Operators statements
4.	Array
5.	Development
6.	Exceptions
7.	Function
8.	Structure
9.	Class
10.	Operator Overloading
11.	Pointer
12.	File Stream
13.	template
14.	STL Introduction
15.	string
16.	vector
17.	list
18.	bitset
19.	set multiset
20.	valarray
21.	queue stack
22.	deque
23.	map multimap
24.	STL Algorithms Modifying sequence operations
25.	STL Algorithms Non modifying sequence operations
26.	STL Algorithms Binary search
27.	STL Algorithms Sorting
28.	STL Algorithms Merge
29.	STL Algorithms Min Max
30.	STL Algorithms Iterator
31.	STL Algorithms Heap
32.	STL Algorithms Helper

C / ANSI-C

C Tutorial

C++

Visual C++ .NET

C++ Tutorial » STL Algorithms Helper » accumulate

32.3.4.Illustrating the generic accumulate algorithm with predicate

#include <iostream>

#include <cassert>

#include <algorithm>

#include <functional>

#include <numeric>

using namespace std;



int main()

{

  int x[20];

  

  for (int i = 0; i < 20; ++i)

    x[i] = i;



 // Show that 10 * 1 * 2 * 3 * 4 == 240:

  int result = accumulate(&x[1], &x[5], 10, multiplies<int>());

  cout << result;

 



  

  return 0;

}

32.3.accumulate
	32.3.1.	Calculate sum of elements in a vector
	32.3.2.	Algorithm: Use accumulate to calculate product
	32.3.3.	Demonstrating the generic accumulate algorithm with a reverse iterator
	32.3.4.	Illustrating the generic accumulate algorithm with predicate
	32.3.5.	The total of the elements in a vector

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.