Find a value in map by key : iterator « STL Algorithms Iterator « 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

C / ANSI-C

C Tutorial

C++

Visual C++ .NET

C++ Tutorial » STL Algorithms Iterator » iterator

30.1.2.Find a value in map by key

#include <iostream>

#include <map>

using namespace std;



int main()

{

  map<char, int> m;



  // put pairs into map

  for(int i=0; i<26; i++) {

    m.insert(pair<char, int>('A'+i, 65+i));

  }



  char ch = 'G';



  map<char, int>::iterator p;

  

  // find value given key

  p = m.find(ch);

  if(p != m.end()) 

    cout << "Its ASCII value is  " << p->second;

  else

    cout << "Key not in map.\n";



  return 0;

}

Its ASCII value is  71

30.1.iterator
	30.1.1.	Advance the iterator
	30.1.2.	Find a value in map by key
	30.1.3.	iterator template
	30.1.4.	Convert iterator to reverse iterator

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.