template<class InputIterator, class Function>
Function for_each(InputIterator first, InputIterator last, Function f);

#include <iostream>
#include <list>
#include <algorithm>
using namespace std;
struct MyPrint{
  int count;                   // 設(shè)置元素計(jì)數(shù)
  MyPrint(){ count = 0; }      // 初始化元素
  void operator()(int x)       // 重載小括號(hào)
  {
    cout << x << endl;
    count++;
  }
};
int main(int argc, char* argv[])
{
  list<int> ls {1,2,3,4,5,6,7,8,9};
  MyPrint p = for_each(ls.begin(), ls.end(), MyPrint());
  cout << "Link Count: " << p.count << endl;
  system("pause");
  return 0;
}

template<class InputIterator, class T>
InputIterator find(InputIterator first, InputIterator last, const T& value);

#include <iostream>
#include <list>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[])
{
  list<int> ls{ 1, 2, 3, 4, 5, 6, 7, 8, 9 };
  list<int>::iterator it = find(ls.begin(), ls.end(),6);
  if (it != ls.end())
  {
    cout << "找到了元素" << endl;
    cout << "前一個(gè)元素: " << *(--it) << endl;
  }
  system("pause");
  return 0;
}

template<class InputIterator, class T>
InputIterator find(InputIterator first, InputIterator last, const T& value);

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
class Person
{
public:
  string m_name;
  int m_age;
public:Person(string name, int age){
    this->m_name = name;
    this->m_age = age;
  }
public: bool operator==(const Person &p){
  // 重載 == 實(shí)現(xiàn)遍歷數(shù)據(jù)
    if (this->m_name == p.m_name && this->m_age == p.m_age)
      return true;
    return false;
  }
};
int main(int argc, char* argv[])
{
  vector<Person> var;
  Person p1("aaa", 10);
  Person p2("bbb", 20);
  Person p3("ccc", 30);
  var.push_back(p1);
  var.push_back(p2);
  var.push_back(p3);
  vector<Person>::iterator pos = find(var.begin(), var.end(), p1);
  if (pos != var.end())
    cout << "找到姓名: " << (*pos).m_name << endl;
  system("pause");
  return 0;
}

template<class InputIterator, class UnaryPredicate>
InputIterator find_if(InputIterator first, InputIterator last, UnaryPredicate pred);

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool MyFunction(int x) { return x % 5 ? 0 : 1; }
int main(int argc, char* argv[])
{
  vector<int> var(20);
  // 循環(huán)生成數(shù)據(jù)
  for (unsigned int x = 0; x < var.size(); x++)
    var[x] = (x + 1) * (x + 3);
  // 循環(huán)遍歷,并判斷是否符合條件
  vector<int>::iterator it = find_if(var.begin(),var.end(),MyFunction);
  if (it != var.end())
  {
    // 尋找第一個(gè)被5整除的元素
    cout << *it << endl;
    cout << "元素索引: " << it - var.begin() << endl;
  }
  system("pause");
  return 0;
}

template<class InputIterator, class UnaryPredicate>
InputIterator find_if(InputIterator first, InputIterator last, UnaryPredicate pred);

#include <iostream>
#include <vector>
#include <string>
#include <functional>
#include <algorithm>
using namespace std;
class Person
{
public:
  string m_name;
  int m_age;
public:Person(string name, int age){
       this->m_name = name;
       this->m_age = age;
}
public: bool operator==(const Person &p){
    // 重載 == 實(shí)現(xiàn)遍歷數(shù)據(jù)
    if (this->m_name == p.m_name && this->m_age == p.m_age)
      return true;
    return false;
  }
};
// 使用binary_function適配函數(shù)實(shí)現(xiàn)傳遞兩個(gè)Person數(shù)據(jù)
class MyCompare:public binary_function<Person *,Person *,bool>
{
public: bool operator()(Person *p1,Person *p2) const {
    // 對(duì)比函數(shù),重載() 用于實(shí)現(xiàn)指針元素的對(duì)比
    if (p1->m_name == p2->m_name && p1->m_age == p2->m_age)
      return true;
    return false;
  }
};
int main(int argc, char* argv[])
{
  vector<Person *> var;
  Person p1("aaa", 10);
  Person p2("bbb", 20);
  Person p3("ccc", 30);
  var.push_back(&p1);
  var.push_back(&p2);
  var.push_back(&p3);
  // 查找這個(gè)屬性的類成員
  Person *ptr = new Person("bbb", 20);
  // 通過(guò)使用bind2nd綁定事件,將ptr傳遞給MyCompare() 即可實(shí)現(xiàn)兩個(gè)類屬性的對(duì)比查找
  vector<Person *>::iterator pos = find_if(var.begin(), var.end(), bind2nd(MyCompare(),ptr));
  if (pos != var.end())
    cout << "找到姓名: " << (*pos)->m_name << endl;
  system("pause");
  return 0;
}

template<class InputIterator>
InputIterator adjacent_find(InputIterator first, InputIterator last);

#include <iostream>
#include <list>
#include <algorithm>
using namespace std;
bool MyFunction(int x,int y) { return (x - y) % 2 == 0 ? 1 : 0; }
int main(int argc, char* argv[])
{
  list<int> ls {1,2,3,4,5,6,6,7,8,9,10};
  // 查找鏈表中鄰接相等的元素
  list<int>::iterator it = adjacent_find(ls.begin(), ls.end());
  if (it != ls.end())
    cout << *it << endl;
  // 查找基偶性相同的鄰接元素
  it = adjacent_find(ls.begin(), ls.end(), MyFunction);
  if (it != ls.end())
  {
    cout << *it << endl;
    it++;
    cout << *it << endl;
  }
  system("pause");
  return 0;
}

template<class InputIterator, class ForwardIterator>
InputIterator find_first_of(InputIterator first1, InputIterator last1, ForwardIterator first2, ForwardIterator last2);

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[])
{
  char * str1 = "hello";
  char * str2 = "lyshark This is a test case. Thank you for using it lyshark.";
  char * result = find_first_of(str1, str1 + strlen(str1), str2, str2 + strlen(str2));
  // 字符串str1的第一個(gè)字符,第一次出現(xiàn)在str2中的字符為.
  cout << *result << endl;
  system("pause");
  return 0;
}

template<class InputIterator, class T>
typename iterator_traits<InputIterator>::difference_type count(InputIterator first, InputIterator last, const T& value);

#include <iostream>
#include <list>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[])
{
  list<int> ls;
  // 批量插入測(cè)試數(shù)據(jù)
  for (int x = 0; x < 100; x++)
  {
    ls.push_back(x % 20);
  }
  // 統(tǒng)計(jì)元素value出現(xiàn)次數(shù),將次數(shù)放入num中.
  int num = 0; int value = 9;
  num = count(ls.begin(), ls.end(), value);
  cout << "這個(gè)值出現(xiàn)過(guò)(次): " << num << endl;
  system("pause");
  return 0;
}

template<class InputIterator, class UnaryPredicate>
typename iterator_traits<InputIterator>::difference_type count_if(InputIterator first, InputIterator last, UnaryPredicate pred);

#include <iostream>
#include <map>
#include <algorithm>
using namespace std;
struct Student{
  struct Info{
    char *name; // 學(xué)生姓名
    int year;   // 學(xué)生年齡
  };
  int id;    // 學(xué)號(hào)
  Info stu;  // 學(xué)生Info數(shù)據(jù)
  Student(int _id, char *_name, int _year)
  {
    id = _id;
    stu.name = _name;
    stu.year = _year;
  }
};
// 獲取學(xué)生年齡大于20歲并且小于30歲的人
bool GetRange(pair<int, Student::Info> s)
{
  if (s.second.year > 20 && s.second.year < 30)
    return 1;
  return 0;
}
int main(int argc, char* argv[])
{
  // 初始化學(xué)生數(shù)據(jù)
  Student stu1 = Student(1, "admin", 10);
  Student stu2 = Student(2, "guest", 21);
  Student stu3 = Student(3, "lyshark", 35);
  // 映射Map結(jié)構(gòu)數(shù)據(jù),并將上方的數(shù)據(jù)插入到Map中
  map<int, Student::Info> mp;
  pair<int, Student::Info> pairSt1(stu1.id, stu1.stu);
  mp.insert(pairSt1);
  pair<int, Student::Info> pairSt2(stu2.id, stu2.stu);
  mp.insert(pairSt2);
  pair<int, Student::Info> pairSt3(stu3.id, stu3.stu);
  mp.insert(pairSt3);
  // 條件統(tǒng)計(jì),統(tǒng)計(jì)出年齡大于20歲并且小于30歲的人有多少個(gè)= num
  int num = 0;
  num = count_if(mp.begin(), mp.end(), GetRange);
  cout << num << endl;
  system("pause");
  return 0;
}

template<class ForwardIterator, class T>
bool binary_search(ForwardIterator first, ForwardIterator last, const T& value);

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[])
{
  vector<int> var{ 1, 2, 3, 4, 5, 6, 6, 7, 8, 9, 10 };
  bool ret = binary_search(var.begin(), var.end(), 4);
  if (ret)
    cout << "found ok" << endl;
  else
    cout << "not found" << endl;
  system("pause");
  return 0;
}

template<class InputIterator1, class InputIterator2>
pair<InputIterator1,InputIterator2> mismatch (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);

#include <iostream>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
bool StrEqual(const char* x, const char* y)
{
  return strcmp(x, y) == 0 ? 1 : 0;
}
int main(int argc, char* argv[])
{
  vector<int> var1{ 2, 0, 0, 6 };
  vector<int> var2{ 2, 0, 0, 7 };
  // 檢測(cè)var1與var2中不匹配元素?cái)?shù),并輸出
  pair<vector<int>::iterator, vector<int>::iterator> result;
  result = mismatch(var1.begin(), var1.end(), var2.begin());
  if (result.first == var1.end() && result.second == var1.end())
    cout << "var1 與var2完全一致" << endl;
  else
    // var1 和var2不相同,不匹配的數(shù)是
    cout << "var1 = " << *result.first << " --> var2= " << *result.second << endl;
  // ---------------------------------------------------------------------------------
  // 針對(duì)字符串的不匹配檢測(cè)
  char * str1[] = { "apple", "pear", "banana", "grape" };
  char * str2[] = { "apple", "pear", "banana", "zoops" };
  pair<char **, char **> result2 = mismatch(str1, str1 + 4, str2, StrEqual);
  if (result2.first != str1 + 4 && result2.second != str2 + 4)
  {
    // 成立則說(shuō)明兩個(gè)str子串有不同的地方,并輸出他們之間的不同點(diǎn)
    cout << "str1 = > " << str1[result2.first - str1] << endl << endl;
    cout << "str2 = > " << str2[result2.second - str2] << endl;
  }
  system("pause");
  return 0;
}

template<class InputIterator1, class InputIterator2>
bool equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool absEqual(const int x,const int y)
{
  return (x == abs(y) || abs(x) == y) ? 1 : 0;
}
int main(int argc, char* argv[])
{
  vector<int> var1;
  vector<int> var2;
  // 初始化向量
  for (unsigned int x = 0; x < var1.size(); x++)
  {
    var1[x] = x;
    var2[x] = -1 * x;
  }
  // 判斷v1和v2元素的絕對(duì)值是否完全相等
  if (equal(var1.begin(), var1.end(), var2.begin(), absEqual))
  {
    cout << "完全相等" << endl;
  }
  system("pause");
  return 0;
}

template<class ForwardIterator1, class ForwardIterator2>
ForwardIterator1 search(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2);

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[])
{
  vector<int> var1 = { 5, 6, 7, 8, 9 };
  vector<int> var2 = { 7, 8 };
  // 檢查var2是否構(gòu)成var1的子序列
  vector<int>::iterator it;
  it = search(var1.begin(), var1.end(), var2.begin(),var2.end());
  if (it != var1.end())
  {
    // 輸出var2元素包含在var1中,的起始元素為
    cout << "Offset = " << it - var1.begin() << endl;
  }
  system("pause");
  return 0;
}

template<class ForwardIterator, class Size, class T, class BinaryPredicate>
ForwardIterator search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value, BinaryPredicate pred);

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[])
{
  vector<int> var1 = { 5, 6, 7, 8,8,8,9 };
  // 查找var1中存在三個(gè)連續(xù)是8的數(shù)據(jù)
  vector<int>::iterator it;
  it = search_n(var1.begin(), var1.end(), 3, 8);
  if (it != var1.end())
  {
    cout << "var1中存在三連8" << endl;
  }
  system("pause");
  return 0;
}

template<class ForwardIterator1, class ForwardIterator2>
ForwardIterator1 find_end(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2);

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[])
{
  vector<int> var1 = { -5,1,2,-6,-8,1,2,-11 };
  vector<int> var2 = { 1, 2 };
  // var1中查找最后一個(gè)子序列var2
  vector<int>::iterator it;
  it = find_end(var1.begin(), var1.end(), var2.begin(), var2.end());
  // 打印子序列在var1的起始位置,輸出起offset
  if (it != var1.end())
    cout << "offset = [" << it - var1.begin() << "]" << endl;
  system("pause");
  return 0;
}