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.8.find
	25.8.1.	Use find to search an element in a container
	25.8.2.	find an element in a list
	25.8.3.	Find the maximum element in a range in a list
	25.8.4.	Locate first occurrence of a value in a vector
	25.8.5.	Using find with normal iteration
	25.8.6.	Demonstrating generic find algorithm with an array
	25.8.7.	Generic find algorithm: use find function to find an element in an array
	25.8.8.	Use find algorithm to find an element in a list
	25.8.9.	Use istream_iterator and find
	25.8.10.	Generic find algorithm with input iterators associated with io streams
	25.8.11.	Use assert to check the find method
	25.8.12.	Define == operator in order to use the find method
	25.8.13.	Find an Element and Its Position in a Vector
	25.8.14.	find a value in vector
	25.8.15.	Find empty string

All other trademarks are property of their respective owners.