print the maximum number of pairs that DateMap can hold : pair « Map Multimap « 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++ » Map Multimap » pairScreenshots 
print the maximum number of pairs that DateMap can hold
   
#include <map>
#include <iostream>
#include <string>

using namespace std;

typedef map<string, int> STRING2INT;

int main(void)
{
    STRING2INT DateMap;
    STRING2INT::iterator DateIterator;
    string DateBuffer;

    cout << "DateMap is capable of holding " << DateMap.max_size()
         << " <string,int> pairs" << endl;

 }
  
    
    
  
Related examples in the same category
1.Inserting pairs of object into map
2.Use map to store the value of the month name and its day number
3.Iterating over the elements of the map and using the current pair option and second elements.
4.Put pairs to map with insert
5.Map for string key and integer value
6.for each basic
7.Computing the Median 1
8.Sort a list of int and string pairs
9.Pass output message function to for_each function
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.