Mega Code Archive

 

Categories / C++ / Algorithm

 

Illustrating the generic adjacent_find algorithm

#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  */