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

Home
C++
1.Bitset
2.Class
3.Console
4.Data Structure
5.Data Type
6.Deque
7.Development
8.File
9.Function
10.Generic
11.Language
12.List
13.Map Multimap
14.Overload
15.Pointer
16.Qt
17.Queue Stack
18.Set Multiset
19.STL Algorithms Binary search
20.STL Algorithms Heap
21.STL Algorithms Helper
22.STL Algorithms Iterator
23.STL Algorithms Merge
24.STL Algorithms Min Max
25.STL Algorithms Modifying sequence operations
26.STL Algorithms Non modifying sequence operations
27.STL Algorithms Sorting
28.STL Basics
29.String
30.Valarray
31.Vector
C / ANSI-C
C Tutorial
C++ Tutorial
Visual C++ .NET
C++ » STL Algorithms Non modifying sequence operations » adjacent_findScreenshots 
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
 */        
  
Related examples in the same category
1.adjacent_find: search first two elements with equal value
2.adjacent_find: search first two elements for which the second has double the value of the first
3.Use generic adjacent_find algorithm with a predicate to find the first name that is lexicographically greater than the next one
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.