QMultiMap<QString, int> map1, map2, map3;

map1.insert("plenty", 100);
map1.insert("plenty", 2000);
// map1.size() == 2

map2.insert("plenty", 5000);
// map2.size() == 1

map3 = map1 + map2;
// map3.size() == 3

QList<int> values = map.values("plenty");
for (int i = 0; i < values.size(); ++i)
    cout << values.at(i) << endl;

QMultiMap<QString, int>::iterator i = map.find("plenty");
while (i != map.end() && i.key() == "plenty") {
    cout << i.value() << endl;
    ++i;
}

Member Function Documentation

QMultiMap::​QMultiMap()

Constructs an empty map.

QMultiMap::​QMultiMap(std::initializer_list<std::pair<Key, T> > list)

Constructs a multi map with a copy of each of the elements in the initializer list list.

This function is only available if the program is being compiled in C++11 mode.

This function was introduced in Qt 5.1.

QMultiMap::​QMultiMap(const QMap<Key, T> & other)

Constructs a copy of other (which can be a QMap or a QMultiMap).

See also operator=().

QMap<Key, T>::const_iterator QMultiMap::​constFind(const Key & key, const T & value) const

Returns an iterator pointing to the item with key key and the value value in the map.

If the map contains no such item, the function returns constEnd().

This function was introduced in Qt 4.3.

See also QMap::constFind().

QMap<Key, T>::const_iterator QMultiMap::​constFind(const Key & key) const

This is an overloaded function.

See also QMap::constFind().

bool QMultiMap::​contains(const Key & key, const T & value) const

Returns true if the map contains an item with key key and value value; otherwise returns false.

This function was introduced in Qt 4.3.

See also QMap::contains().

bool QMultiMap::​contains(const Key & key) const

This is an overloaded function.

See also QMap::contains().

int QMultiMap::​count(const Key & key, const T & value) const

Returns the number of items with key key and value value.

This function was introduced in Qt 4.3.

See also QMap::count().

int QMultiMap::​count(const Key & key) const

This is an overloaded function.

See also QMap::count().

int QMultiMap::​count() const

This is an overloaded function.

See also QMap::count().

QMap<Key, T>::iterator QMultiMap::​find(const Key & key, const T & value)

Returns an iterator pointing to the item with key key and value value in the map.

If the map contains no such item, the function returns end().

If the map contains multiple items with key key, this function returns an iterator that points to the most recently inserted value.

This function was introduced in Qt 4.3.

See also QMap::find().

QMap<Key, T>::iterator QMultiMap::​find(const Key & key)

This is an overloaded function.

See also QMap::find().

QMap<Key, T>::const_iterator QMultiMap::​find(const Key & key, const T & value) const

This is an overloaded function.

Returns a const iterator pointing to the item with the given key and value in the map.

If the map contains no such item, the function returns end().

If the map contains multiple items with the specified key, this function returns a const iterator that points to the most recently inserted value.

This function was introduced in Qt 4.3.

See also QMap::find().

QMap<Key, T>::const_iterator QMultiMap::​find(const Key & key) const

This is an overloaded function.

This function was introduced in Qt 4.3.

See also QMap::find().

QMap<Key, T>::iterator QMultiMap::​insert(const Key & key, const T & value)

Inserts a new item with the key key and a value of value.

If there is already an item with the same key in the map, this function will simply create a new one. (This behavior is different from replace(), which overwrites the value of an existing item.)

See also replace().

QMap<Key, T>::iterator QMultiMap::​insert(QMap<Key, T>::const_iterator pos, const Key & key, const T & value)

Inserts a new item with the key key and value value and with hint pos suggesting where to do the insert.

If constBegin() is used as hint it indicates that the key is less than any key in the map while constEnd() suggests that the key is larger than any key in the map. Otherwise the hint should meet the condition (pos - 1).key() < key <= pos.key(). If the hint pos is wrong it is ignored and a regular insert is done.

If there is already an item with the same key in the map, this function will simply create a new one.

Note: Be careful with the hint. Providing an iterator from an older shared instance might crash but there is also a risk that it will silently corrupt both the map and the pos map.

This function was introduced in Qt 5.1.

int QMultiMap::​remove(const Key & key, const T & value)

Removes all the items that have the key key and the value value from the map. Returns the number of items removed.

This function was introduced in Qt 4.3.

See also QMap::remove().

int QMultiMap::​remove(const Key & key)

This is an overloaded function.

See also QMap::remove().

QMap<Key, T>::iterator QMultiMap::​replace(const Key & key, const T & value)

Inserts a new item with the key key and a value of value.

If there is already an item with the key key, that item's value is replaced with value.

If there are multiple items with the key key, the most recently inserted item's value is replaced with value.

See also insert().

void QMultiMap::​swap(QMultiMap<Key, T> & other)

Swaps map other with this map. This operation is very fast and never fails.

This function was introduced in Qt 4.8.

QMultiMap QMultiMap::​operator+(const QMultiMap & other) const

Returns a map that contains all the items in this map in addition to all the items in other. If a key is common to both maps, the resulting map will contain the key multiple times.

See also operator+=().

QMultiMap & QMultiMap::​operator+=(const QMultiMap & other)

Inserts all the items in the other map into this map and returns a reference to this map.

See also insert() and operator+().