QMultiHash class is a convenience QHash 子类，提供多值哈希。 更多...
| 头： | #include <QMultiHash> |
| qmake: | QT += core |
| 继承： | QHash |
注意： 此类的所有函数 可重入 .
| QMultiHash () | |
| QMultiHash (std::initializer_list<std::pair<Key, T> > list ) | |
| QMultiHash (const QHash<Key, T> & other ) | |
| QMultiHash (QHash<Key, T> && other ) | |
| QHash<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 |
| QHash<Key, T>::iterator | find (const Key & key , const T & value ) |
| QHash<Key, T>::const_iterator | find (const Key & key , const T & value ) const |
| QHash<Key, T>::iterator | insert (const Key & key , const T & value ) |
| int | remove (const Key & key , const T & value ) |
| QHash<Key, T>::iterator | replace (const Key & key , const T & value ) |
| void | swap (QMultiHash & other ) |
| QMultiHash | operator+ (const QMultiHash & other ) const |
| QMultiHash & | operator+= (const QMultiHash & other ) |
| uint | qHash (const QMultiHash<Key, T> & key , uint seed = 0) |
QMultiHash class is a convenience QHash 子类，提供多值哈希。
QMultiHash <Key, T> is one of Qt's generic 容器类 . It inherits QHash and extends it with a few convenience functions that make it more suitable than QHash for storing multi-valued hashes. A multi-valued hash is a hash that allows multiple values with the same key; QHash normally doesn't allow that, unless you call QHash::insertMulti ().
因为 QMultiHash 继承 QHash , all of QHash 's functionality also applies to QMultiHash . For example, you can use isEmpty () to test whether the hash is empty, and you can traverse a QMultiHash 使用 QHash 's iterator classes (for example, QHashIterator ). But in addition, it provides an insert () function that corresponds to QHash::insertMulti (), and a replace () function that corresponds to QHash::insert (). It also provides convenient operator+() and operator+=().
范例：
QMultiHash<QString, int> hash1, hash2, hash3; hash1.insert("plenty", 100); hash1.insert("plenty", 2000); // hash1.size() == 2 hash2.insert("plenty", 5000); // hash2.size() == 1 hash3 = hash1 + hash2; // hash3.size() == 3
不像 QHash , QMultiHash provides no operator[]. Use value () 或 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 = hash.values("plenty"); for (int i = 0; i < values.size(); ++i) cout << values.at(i) << endl;
The items that share the same key are available from most recently to least recently inserted.
A more efficient approach is to call find () to get the STL-style iterator for the first item with a key and iterate from there:
QMultiHash<QString, int>::iterator i = hash.find("plenty"); while (i != hash.end() && i.key() == "plenty") { cout << i.value() << endl; ++i; }
QMultiHash 's key and value data types must be assignable data types . You cannot, for example, store a QWidget as a value; instead, store a QWidget *. In addition, QMultiHash 's key type must provide operator==(), and there must also be a qHash () function in the type's namespace that returns a hash value for an argument of the key's type. See the QHash 文档编制了解细节。
另请参阅 QHash , QHashIterator , QMutableHashIterator ，和 QMultiMap .
构造空哈希。
Constructs a multi-hash 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.
该函数在 Qt 5.1 引入。
构造副本为 other (which can be a QHash 或 QMultiHash ).
另请参阅 operator= ().
Default constructs an instance of QMultiHash.
Returns an iterator pointing to the item with the key 和 value in the hash.
If the hash contains no such item, the function returns constEnd ().
该函数在 Qt 4.3 引入。
另请参阅 QHash::constFind ().
返回
true
if the hash contains an item with the
key
and
value
；否则返回
false
.
该函数在 Qt 4.3 引入。
另请参阅 QHash::contains ().
Returns the number of items with the key and value .
该函数在 Qt 4.3 引入。
另请参阅 QHash::count ().
Returns an iterator pointing to the item with the key and value . If the hash contains no such item, the function returns end ().
If the hash contains multiple items with the key and value , the iterator returned points to the most recently inserted item.
该函数在 Qt 4.3 引入。
另请参阅 QHash::find ().
这是重载函数。
该函数在 Qt 4.3 引入。
Inserts a new item with the key and a value of value .
If there is already an item with the same key in the hash, this function will simply create a new one. (This behavior is different from replace (), which overwrites the value of an existing item.)
另请参阅 replace ().
Removes all the items that have the key and the value value from the hash. Returns the number of items removed.
该函数在 Qt 4.3 引入。
另请参阅 QHash::remove ().
Inserts a new item with the key and a value of value .
If there is already an item with the key , that item's value is replaced with value .
If there are multiple items with the key , the most recently inserted item's value is replaced with value .
另请参阅 insert ().
Swaps hash other with this hash. This operation is very fast and never fails.
该函数在 Qt 4.8 引入。
Returns a hash that contains all the items in this hash in addition to all the items in other . If a key is common to both hashes, the resulting hash will contain the key multiple times.
另请参阅 operator+= ().
Inserts all the items in the other hash into this hash and returns a reference to this hash.
另请参阅 insert ().
返回哈希值为 key ，使用 seed 做计算种子。
类型
T
must be supported by
qHash
().
该函数在 Qt 5.8 引入。
