adjacent_find « STL Algorithms Non modifying sequence operations « C++ Tutorial

1.	Language Basics
2.	Data Types
3.	Operators statements
4.	Array
5.	Development
6.	Exceptions
7.	Function
8.	Structure
9.	Class
10.	Operator Overloading
11.	Pointer
12.	File Stream
13.	template
14.	STL Introduction
15.	string
16.	vector
17.	list
18.	bitset
19.	set multiset
20.	valarray
21.	queue stack
22.	deque
23.	map multimap
24.	STL Algorithms Modifying sequence operations
25.	STL Algorithms Non modifying sequence operations
26.	STL Algorithms Binary search
27.	STL Algorithms Sorting
28.	STL Algorithms Merge
29.	STL Algorithms Min Max
30.	STL Algorithms Iterator
31.	STL Algorithms Heap
32.	STL Algorithms Helper

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

All other trademarks are property of their respective owners.