#include <iostream>
#include <numeric> //包含accumulate算法
#include <functional>
#include <vector>
using namespace std;
int mult(int a, int b) {
    return a * b;
}
int main()
{
    int a[] = { 1, 2, 3, 4, 5, 6, 7 };
    const int N = sizeof(a) / sizeof(int); //用該式確定數(shù)組長(zhǎng)度，定義為常量
    cout << "所有數(shù)累乘為：" << accumulate(a, a + N, 1, mult) << endl; //將普通函數(shù)作為函數(shù)對(duì)象，傳遞函數(shù)名
    //指針a，a + N也可以作為迭代器
    return 0;
}

#include <numeric>
#include <iostream>
using namespace std;
class MultClass {
public:
    int operator ()  (int a, int b) const {
        return a * b;
    }
};
int main()
{
    int a[] = { 1, 2, 3, 4, 5, 6, 7 };
    const int N = sizeof(a) / sizeof(int); //確定數(shù)組a的長(zhǎng)度
    cout << "所有數(shù)乘積為：" << accumulate(a, a + N, 1, MultClass()) << endl; //傳輸方式是類(lèi)名()，輸出5040
    //指針a，a + N也可以作為迭代器
    MultClass ss;
    cout << ss(100, 100); //輸出10000
    return 0;
}

#include <iostream>
#include <functional>
#include <numeric>
using namespace std;
int main(){
	int a[] = { 1, 2, 3, 4, 5, 6, 7 };
	const int N = sizeof(a) / sizeof(int);
	cout << accumulate(a, a + N, 1, multiplies<int>()) << endl;//通過(guò)STL自帶的函數(shù)對(duì)象multiplies實(shí)現(xiàn)乘法，注意要寫(xiě)數(shù)據(jù)類(lèi)型<int>
	//指針a，a + N也可以作為迭代器
	return 0;
}

#include <iostream>
#include <algorithm>
#include <functional> //包含greater
using namespace std;
int main() {
	int arr[] = { 24, 43, 5, 4, 62, 34, 7654, 22 };
	const int N = sizeof(arr) / sizeof(int);
	copy(arr, arr + N, ostream_iterator<int>(cout, "\t"));
	cout << endl;
	sort(arr, arr + N, greater<int>()); //包含在<algorithm>中，默認(rèn)是升序
	copy(arr, arr + N, ostream_iterator<int>(cout, "\t"));
	return 0;
}

#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
using namespace std;
int main()
{
    int a[] = { 30, 40, 50, 90, 20, 10 };
    const int N = sizeof(a) / sizeof(int);
    int *c = find_if(a, a + N, bind2nd(greater<int>(), 40));
    cout << *c << endl;
    return 0;
}

int main()
{
    int a[] = { 30, 40, 50, 90, 20, 10 };
    const int N = sizeof(a) / sizeof(int);
    vector<int> v (a, a + N); //用數(shù)組初始化vector
    vector<int>::iterator p = find_if (v.begin(), v.end(), bind2nd(greater<int>(), 40) );
    if (p == v.end())
        cout << "找不到" << endl;
    else
        cout << *p << endl;
    return 0;
}

find_if算法在STL中的原型聲明為：
template<class InputIterator, class UnaryPredicate>
InputIterator find_if(InputIterator first, InputIterator last, UnaryPredicate pred);
它的功能是查找數(shù)組[first, last)區(qū)間中第一個(gè)pred(x)為真的元素。
InputIterator、UnaryPredicate是用概念來(lái)做模板參數(shù)名

#include <iostream>
#include <functional>
#include <algorithm>
#include <vector>
using namespace std;
int g(int x, int y) { //實(shí)現(xiàn)類(lèi)似greater的功能
    return x > y;
}
int main()
{
    int a[] = { 30, 90, 10, 23, 432, 656, 7, 78 };
    const int N = sizeof(a) / sizeof(int);
    vector<int> v(a, a + N);
    auto p1 = find_if(v.begin(), v.end(), bind2nd(ptr_fun(g), 40)); //找第一個(gè)大于40的數(shù)
    //ptr_fun將函數(shù)指針轉(zhuǎn)換為函數(shù)對(duì)象，bind2nd將40作為二元函數(shù)對(duì)象的第二個(gè)參數(shù)
    if (p1 == v.end())
        cout << "no element" << endl;
    else
        cout << *p1 << endl;
    auto p2 = find_if(v.begin(), v.end(), not1(bind2nd(ptr_fun(g), 15))); //找第一個(gè)不大于15的數(shù)
    //not1對(duì)一元函數(shù)對(duì)象取邏輯反，find_if找到第一個(gè)令bind2nd取false的值
    if (p2 == v.end())
        cout << "no element" << endl;
    else
        cout << *p2 << endl;
    auto p3 = find_if(v.begin(), v.end(), bind2nd(not2(ptr_fun(g)), 15)); // 找第一個(gè)不大于15的數(shù)
    //not2對(duì)二元函數(shù)取邏輯反
    if (p3 == v.end())
        cout << "no element" << endl;
    else
        cout << *p3 << endl;
    return 0;
}

#include <iostream>
#include <vector>
#include <functional>
#include <algorithm>
using namespace std;
struct Car
{
	int id;
	Car(int id) {
		this->id = id;
	}
	void display() const {
		cout << "car " << id << endl;
	}
};
int main() {
	vector<Car*> pcars;
	vector<Car> cars;
	for (int i = 0; i < 5; i++)
		pcars.push_back(new Car(i)); //push_back() 在Vector最后添加一個(gè)元素(參數(shù)為要插入的值）
	for (int i = 5; i < 10; i++)
		cars.push_back(Car(i));
	cout << "elements in pcars: " << endl;
	for_each(pcars.begin(), pcars.end(), mem_fun(&Car::display));//for_each算法對(duì)每一個(gè)迭代器范圍中的元素進(jìn)行函數(shù)對(duì)象計(jì)算
	//men_fun適配后函數(shù)對(duì)象的參數(shù)為"對(duì)象的指針"
	cout << endl;
	for_each(cars.begin(), cars.end(), mem_fun_ref(&Car::display));
	//men_fun_ptr適配后函數(shù)對(duì)象的參數(shù)為"對(duì)象的引用"
	cout << endl;
	for (size_t i = 0; i < pcars.size(); ++i)
		delete pcars[i];
	return 0;
}