The QMultiMap class is a convenience QMap subclass that provides multi-valued maps. More...
| Header: | #include <QMultiMap> |
| qmake: | QT += core |
| Inherits: | QMap |
Note: All functions in this class are reentrant.
| QMultiMap(const QMap<Key, T> &other) | |
| QMultiMap(std::initializer_list<std::pair<Key, T> > list) | |
| QMultiMap() | |
| typename QMap<Key, T>::const_iterator | constFind(const Key &key, const T &value) const |
| bool | contains(const Key &key, const T &value) const |
| int | count(const Key &key, const T &value) const |
| typename QMap<Key, T>::iterator | find(const Key &key, const T &value) |
| typename QMap<Key, T>::const_iterator | find(const Key &key, const T &value) const |
| typename QMap<Key, T>::iterator | insert(const Key &key, const T &value) |
| typename QMap<Key, T>::iterator | insert(typename QMap<Key, T>::const_iterator pos, const Key &key, const T &value) |
| int | remove(const Key &key, const T &value) |
| typename QMap<Key, T>::iterator | replace(const Key &key, const T &value) |
| void | swap(QMultiMap<Key, T> &other) |
| QList<Key> | uniqueKeys() const |
| QMultiMap<K, V> & | unite(const QMultiMap<K, V> &other) |
| QList<T> | values(const Key &key) const |
| QMultiMap<K, V> | operator+(const QMultiMap<K, V> &other) const |
| QMultiMap<K, V> & | operator+=(const QMultiMap<K, V> &other) |
QMultiMap<Key, T> is one of Qt's generic container classes. It inherits QMap and extends it with a few functions that make it able to store multi-valued maps. A multi-valued map is a map that allows multiple values with the same key; QMap doesn't allow that.
Because QMultiMap inherits QMap, all of QMap's functionality also applies to QMultiMap. For example, you can use isEmpty() to test whether the map is empty, and you can traverse a QMultiMap using QMap's iterator classes (for example, QMapIterator). But in addition, it provides an insert() function that inserts but does not overwrite any previous value if the key already exists, and a replace() function that corresponds which does overwite an existing value if they key is already in the map. It also provides convenient operator+() and operator+=().
Example:
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 Unlike QMap, QMultiMap provides no operator[]. Use value() or replace() if you want to access the most recently inserted item with a certain key.
If you want to retrieve all the values for a single key, you can use values(const Key &key), which returns a QList<T>:
QList<int> values = map.values("plenty");
for (int i = 0; i < values.size(); ++i)
cout << values.at(i) << Qt::endl; The items that share the same key are available from most recently to least recently inserted.
If you prefer the STL-style iterators, you can call find() to get the iterator for the first item with a key and iterate from there:
QMultiMap<QString, int>::iterator i = map.find("plenty");
while (i != map.end() && i.key() == "plenty") {
cout << i.value() << Qt::endl;
++i;
} QMultiMap's key and value data types must be assignable data types. This covers most data types you are likely to encounter, but the compiler won't let you, for example, store a QWidget as a value; instead, store a QWidget *. In addition, QMultiMap's key type must provide operator<(). See the QMap documentation for details.
See also QMap, QMapIterator, QMutableMapIterator, and QMultiHash.
Constructs a copy of other (which can be a QMap or a QMultiMap).
See also operator=().
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.
Constructs an empty map.
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().
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().
Returns the number of items with key key and value value.
This function was introduced in Qt 4.3.
See also QMap::count().
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().
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().
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().
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.
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().
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().
Swaps map other with this map. This operation is very fast and never fails.
This function was introduced in Qt 4.8.
Returns a list containing all the keys in the map in ascending order. Keys that occur multiple times in the map occur only once in the returned list.
This function was introduced in Qt 4.2.
Inserts all the items in the other map into this map. If a key is common to both maps, the resulting map will contain the key multiple times.
Returns a list containing all the values associated with key key, from the most recently inserted to the least recently inserted one.
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+=().
Inserts all the items in the other map into this map and returns a reference to this map.
See also insert() and operator+().
© The Qt Company Ltd
Licensed under the GNU Free Documentation License, Version 1.3.
https://doc.qt.io/qt-5.15/qmultimap.html