STL map mulimap

Sparse array example: (why hold space for thousands of elements when all we have is five)

01 #include <string.h> 02 #include <iostream> 03 #include <map> 04 #include <utility> 05   06 using namespace std; 07   08 int main() 09 { 10    map<int, string> Employees; 11   12    // 1) Assignment using array index notation 13    Employees[5234] = "Mike C."; 14    Employees[3374] = "Charlie M."; 15    Employees[1923] = "David D."; 16    Employees[7582] = "John A."; 17    Employees[5328] = "Peter Q."; 18   19    cout << "Employees[3374]=" << Employees[3374] << endl << endl; 20   21    cout << "Map size: " << Employees.size() << endl; 22   23    for( map<int,string>::iterator ii=Employees.begin(); ii!=Employees.end(); ++ii) 24    { 25        cout << (*ii).first << ": " << (*ii).second << endl; 26    } 27 }

Compile: g++ testMap.cpp
Run: ./a.out

Employees[3374]=Charlie M.  Map size: 5 1923: David D. 3374: Charlie M. 5234: Mike C. 5328: Peter Q. 7582: John A. 

Example using a "string" as an array index:

01 #include <string.h> 02 #include <iostream> 03 #include <map> 04 #include <utility> 05   06 using namespace std; 07   08 int main() 09 { 10    map<string, int> Employees; 11   12    // Examples of assigning Map container contents 13   14    // 1) Assignment using array index notation 15    Employees["Mike C."] = 5234; 16    Employees["Charlie M."] = 3374; 17   18    // 2) Assignment using member function insert() and STL pair 19    Employees.insert(std::pair<string,int>("David D.",1923)); 20    21    // 3) Assignment using member function insert() and "value_type()" 22    Employees.insert(map<string,int>::value_type("John A.",7582)); 23   24    // 4) Assignment using member function insert() and "make_pair()" 25    Employees.insert(std::make_pair("Peter Q.",5328)); 26   27    cout << "Map size: " << Employees.size() << endl; 28   29    for( map<string, int>::iterator ii=Employees.begin(); ii!=Employees.end(); ++ii) 30    { 31        cout << (*ii).first << ": " << (*ii).second << endl; 32    } 33 }

Compile: g++ testMap.cpp
Run: ./a.out

Map size: 5 Charlie M.: 3374 David D.: 1923 John A.: 7582 Mike C.: 5234 Peter Q.: 5328 

Note: The fully defined STL map defines a comparison operator in the map declaration so that the indexes can be ordered. This is used to provide a default comparison operator for the data type. In the above example, the key type is an integer and the C++ "equals" (=) and "less than" operator (<) can operate on an integer so the example works. The use of the STL algorithm std::less<> can be specified explicitly as in the following declaration:

std::map<int, string, std::less< int > >

If defining your own class as the index (first value), C++ will not know how to perform the comparison, thus you will have to provide an operator to perform this function.

The first element in a map can be a class or even another STL container such as a pair. If using a class, the class must provide an overloaded "equals" (=) and "less than" operator (<).

Thus using "char" instead of "string" requires the use of a comparison function:

01 #include <string.h> 02 #include <iostream> 03 #include <map> 04 #include <utility> 05   06 using namespace std; 07   08 struct cmp_str 09 { 10    bool operator()(char const *a, char const *b) 11    { 12       return std::strcmp(a, b) < 0; 13    } 14 }; 15   16 int main() 17 { 18    map<char *, int, cmp_str> Employees; 19   20    // Examples of assigning Map container contents 21   22    // 1) Assignment using array index notation 23    Employees["Mike C."] = 5234; 24    Employees["Charlie M."] = 3374; 25   26    // 2) Assignment using member function insert() and STL pair 27    Employees.insert(std::pair<char *,int>("David D.",1923)); 28    29    // 3) Assignment using member function insert() and "value_type()" 30    Employees.insert(map<char *,int>::value_type("John A.",7582)); 31   32    // 4) Assignment using member function insert() and "make_pair()" 33    Employees.insert(std::make_pair((char *)"Peter Q.",5328)); 34   35    cout << "Map size: " << Employees.size() << endl; 36   37    for( map<char *, int, cmp_str>::iterator ii=Employees.begin(); ii!=Employees.end(); ++ii) 38    { 39        cout << (*ii).first << ": " << (*ii).second << endl; 40    } 41 }

Compile: g++ testMap.cpp
Run: ./a.out

Map size: 5 Charlie M.: 3374 David D.: 1923 John A.: 7582 Mike C.: 5234 Peter Q.: 5328 

SGI Map Documentation:

• map

---

Example: STL multimap:

The STL multipmap allows duplicate keys.

01 #include <string.h> 02 #include <iostream> 03 #include <map> 04 #include <utility> 05   06 using namespace std; 07   08 int main() 09 { 10   // Compare (<) function not required since it is built into string class. 11   // else declaration would comparison function in multimap definition. 12   // i.e. multimap<string, int, compare> m; 13   14   multimap<string, int> m; 15   16   m.insert(pair<string, int>("a", 1)); 17   m.insert(pair<string, int>("c", 2)); 18   m.insert(pair<string, int>("b", 3)); 19   m.insert(pair<string, int>("b", 4)); 20   m.insert(pair<string, int>("a", 5)); 21   m.insert(pair<string, int>("b", 6)); 22   23   cout << "Number of elements with key a: " << m.count("a") << endl; 24   cout << "Number of elements with key b: " << m.count("b") << endl; 25   cout << "Number of elements with key c: " << m.count("c") << endl; 26   27   cout << "Elements in m: " << endl; 28   for (multimap<string, int>::iterator it = m.begin(); 29        it != m.end(); 30        ++it) 31    { 32        cout << "  [" << (*it).first << ", " << (*it).second << "]" << endl; 33    } 34   35    pair<multimap<string, int>::iterator, multimap<string, int>::iterator> ppp; 36   37    // equal_range(b) returns pair<iterator,iterator> representing the range 38    // of element with key b 39    ppp = m.equal_range("b"); 40   41    // Loop through range of maps of key "b" 42    cout << endl << "Range of \"b\" elements:" << endl; 43    for (multimap<string, int>::iterator it2 = ppp.first; 44        it2 != ppp.second; 45        ++it2) 46    { 47        cout << "  [" << (*it2).first << ", " << (*it2).second << "]" << endl; 48    } 49   50 // Can't do this (??) 51 //   cout << ppp.first << endl; 52 //   cout << ppp.second << endl; 53   54    m.clear(); 55 }

Compile: g++ testMultimap.cpp
Run: ./a.out

Number of elements with key a: 2
Number of elements with key b: 3
Number of elements with key c: 1
Elements in m:
  [a, 1]
  [a, 5]
  [b, 3]
  [b, 4]
  [b, 6]
  [c, 2]

Range of "b" elements:
  [b, 3]
  [b, 4]
  [b, 6]