Map (C++ container)

The class std::map is a standard C++ container. It is a sorted associative array, which is a data structure which acts like a dynamic one-dimensional array that associates values of one type with values of another type (the two types of values may be the same). [ [http://uw713doc.sco.com/en/SDK_c++/_Intro_map.html Introduction ] ] Specifically, this type of associative array maps objects of type Key to objects of type Data. Typically, the key value is used to identify the element and the data is some sort of value associated with this key. The types of key and data may differ, and the elements of the map are internally sorted from lowest to highest key value. Each key value is unique; if an object is inserted with an already existing key, the object already present in the map is not changed in any way. [http://www.cplusplus.com/reference/stl/map/ map - C++ Reference ] ] A variation on the map, called the multimap, allows keys to be duplicated.

Iterators are not invalidated by insert and erase operations which don't remove the object to which the iterator points. The usual implementation is a self-balancing binary search tree (but any other data structure that respects the complexity constraints can be used, like a skip list).

Main Characteristics

* Each element has a unique key
* Each element is composed of a key and a mapped value
* Elements follow a strict weak ordering

Performance

* Searching for an element takes "O(log n)" time
* Inserting a new element takes "O(log n)" time plus the time to call malloc once
* Incrementing/decrementing an iterator takes "O(log n)" time
* Iterating through every element of a map takes "O(n)" time
* Removing a single map element takes "O(log n)" time
* Copying an entire map takes "O(n log n)" time. [ [http://uw713doc.sco.com/en/SDK_c++/_Perform_map.html Performance ] ]

Maps are designed to be especially efficient in accessing its elements by their key, as opposed to sequence containers which are more efficient in accessing elements by their position (although maps are able to directly access elements with the operator [] ).

Usage

The map is declared in this format:

map <"key_type", "value_type" [, "comparing_option" [, "memory_allocator"] ] > "map_name"

The following code demonstrates how to use the map to count occurrences of words. It uses the word as the key and the count as the value.
#include
#include
#include

using namespace std;

int main(){ map wordcounts; string s;

while (cin >> s && s != "end") ++wordcounts [s] ;

while (cin >> s && s != "end") cout << s << ' ' << wordcounts [s] << endl;}

When executed, the user first types a series of words separated by spaces, and a word "end" to signify the end of input; then the user can input words to query how many times each word occurred in the previous series.

The above example also demonstrates that the operator " [] " inserts new objects (using the default constructor) in the map if there isn't one associated with the key. So integral types are zero-initialized, strings are initialized to empty strings, etc.

The following example illustrates inserting elements into a map using the insert function and searching for a key using a map iterator and the find function:

#include
#include

int main(){ typedef map mapType; mapType myMap;

// insert elements using insert function myMap.insert(pair('a', 1)); myMap.insert(pair('b', 2)); myMap.insert(pair('c', 3)); myMap.insert(pair('d', 4)); myMap.insert(pair('e', 5));

// erase the first element using the erase function mapType::iterator iter = myMap.begin(); myMap.erase(iter);

// output the size of the map cout << "Size of my
<< myMap.size() << endl;

cout << "Enter a key to search for: "; char c; cin >> c;

// find will return an iterator to the matching element if it is found // or to the end of the map if the key is not found iter = myMap.find(c); if( iter != myMap.end() ) cout << "Value is: " << iter->second << endl; else cout << "Key is not in myMap" << endl;

// clear the entries in the map myMap.clear();}

In the above example, five elements are entered using the insertion function, and then the first element is deleted. Then, the size of the map is output. Next, the user is prompted for a key to search for. Using the iterator, the find function searches for an element with the given key. If it finds the key, the program prints the element's value. If it does not find it, an iterator to the end of the map is returned and it outputs that the key could not be found. Finally all the elements in the tree are erased.

Iterators

Maps may use iterators to point to specific elements in the container. An iterator can access both the key and the mapped value of an element:

map::iterator it; // declares a map iterator(*it).first; // the key valueit->first; // the same key value (*it).second; // the mapped valueit->second; // the same mapped value(*it); // the "element value", which is of type: pair

Below is an example of looping through a map to display all keys and values using iterators:
#include
#include
#include

using namespace std;

int main(){ typedef map mapType; mapType data; // let's declare some initial values to this map data ["BobsScore"] = 10; data ["MartysScore"] = 15; data ["MehmetsScore"] = 34; data ["RockysScore"] = 22; // Iterate over the map and print out all key/value pairs. // Using a const_iterator since we are not going to change the values. for(mapType::const_iterator it = data.begin(); it != data.end(); ++it) { cout << "Who(key = first): " << it->first; cout << " Score(value = second): " << it->second << endl; }

return 0;}

This will output the keys and values of the entire map.

Member functions

What follows is a list of the public member functions in the map library:

Member Types

What follows is a list of the member types of the map container:

References

ee also

*Standard Template Library containers
*unordered_map