A map: insert pair, find, end : Map « Data Structure « C++

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.  Queue Stack 17.  Set Multiset 18.  STL Algorithms Binary search 19.  STL Algorithms Heap 20.  STL Algorithms Helper 21.  STL Algorithms Iterator 22.  STL Algorithms Merge 23.  STL Algorithms Min Max 24.  STL Algorithms Modifying sequence operations 25.  STL Algorithms Non modifying sequence operations 26.  STL Algorithms Sorting 27.  STL Basics 28.  String 29.  Valarray 30.  Vector Java Java Tutorial Java Source Code / Java Documentation Java Open Source Jar File Download Java Articles Java Products Java by API Photoshop Tutorials Maya Tutorials Flash Tutorials 3ds-Max Tutorials Illustrator Tutorials GIMP Tutorials C# / C Sharp C# / CSharp Tutorial C# / CSharp Open Source ASP.Net ASP.NET Tutorial JavaScript DHTML JavaScript Tutorial JavaScript Reference HTML / CSS HTML CSS Reference C / ANSI-C C Tutorial C++ Tutorial Ruby PHP Python Python Tutorial Python Open Source SQL Server / T-SQL SQL Server / T-SQL Tutorial Oracle PL / SQL Oracle PL/SQL Tutorial PostgreSQL SQL / MySQL MySQL Tutorial VB.Net VB.Net Tutorial Flash / Flex / ActionScript VBA / Excel / Access / Word XML XML Tutorial Microsoft Office PowerPoint 2007 Tutorial Microsoft Office Excel 2007 Tutorial Microsoft Office Word 2007 Tutorial

C++ » Data Structure » Map Screenshots  A map: insert pair, find, end #include <iostream> #include <map> using namespace std; int main() {   map<char, int> mapObject;   int i;   for(i = 0; i <10; i++) {     mapObject.insert(pair<char, int>('A'+i, i));   }   char ch;   cout << "Enter key: ";   cin >> ch;   map<char, int>::iterator p;      p = mapObject.find(ch);   if(p != mapObject.end())      cout << p->second;   else     cout << "Key not in map.\n";   return 0; }                     Related examples in the same category 1.  A map of opposites. 2.  A map of word opposites, using strings. 3.  Cycle through a map using an iterator. 4.  Cycle through a map in reverse. 5.  Using [] in Map 6.  [] automatically inserts elements. 7.  Maps can store only unique keys. 8.  Use a map to create a phone directory: string class 9.  Use the greater function object in Map 10.  Demonstrating a multimap. 11.  Use a multimap to create the phone directory. 12.  A simple map: char and int 13.  Use a map of strings to create a phone directory. 14.  File and map