1berry/qtbase
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

QMultiHash: fix/update class description documentation

Browse Source 
It no longer inherits QHash, so drop the references to this.

And remove an extra 'and'.

Pick-to: 6.9 6.8
Change-Id: I5c19f7793571fe04f93e0ede37d280d215d95dfc
Reviewed-by: Marc Mutz <marc.mutz@qt.io>
This commit is contained in:
Mårten Nordheim 2025-02-05 15:46:52 +01:00
parent b37c580169
commit dc8055c914
1 changed files with 3 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
src/corelib/tools/qhash.cpp
View File

@ -3018,7 +3018,7 @@ size_t qHash(long double key, size_t seed) noexcept
/*! \class QMultiHash
\inmodule QtCore
\brief The QMultiHash class is a convenience QHash subclass that provides multi-valued hashes.
\brief The QMultiHash class provides a multi-valued hash table.
\compares equality
\ingroup tools
@ -3027,10 +3027,7 @@ size_t qHash(long double key, size_t seed) noexcept
\reentrant
QMultiHash\<Key, T\> is one of Qt's generic \l{container classes}.
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.
It provides a hash table that allows multiple values for the same key.
QMultiHash mostly mirrors QHash's API. For example, you can use isEmpty() to test
whether the hash is empty, and you can traverse a QMultiHash using
@ -3040,7 +3037,7 @@ size_t qHash(long double key, size_t seed) noexcept
QHash::insert(). It also provides convenient operator+() and
operator+=().
Unlike QMultiMap, QMultiHash does not provide and ordering of the
Unlike QMultiMap, QMultiHash does not provide ordering of the
inserted items. The only guarantee is that items that
share the same key will appear consecutively, from the most
recently to the least recently inserted value.