Illustrating the generic adjacent_find algorithm : adjacent_find « STL Algorithms Non modifying sequence operations « C++ Tutorial






#include <iostream>
#include <string>
#include <algorithm>
#include <cassert>
#include <functional>
#include <deque>
using namespace std;

int main()
{
  deque<string> player(5);
  deque<string>::iterator i;

  player[0] = "PPPP";
  player[1] = "AAAAAA";
  player[2] = "AAAAAA";
  player[3] = "NNNNNNNN";
  player[4] = "RRRRRRRRR";

  // Find the first pair of equal consecutive names:
  i = adjacent_find(player.begin(), player.end());

  cout << *i;

  return 0;
}
AAAAAA"








25.1.adjacent_find
25.1.1.adjacent_find: search first two elements with equal value
25.1.2.Illustrating the generic adjacent_find algorithm
25.1.3.adjacent_find: search first two elements for which the second has double the value of the first
25.1.4.Use generic adjacent_find algorithm with a predicate to find the first name that is lexicographically greater than the next one