QMultiHash< Key, T > Class Template Reference
#include <qcontainerfwd.h>
template<class Key, class T>
class QMultiHash< Key, T >
Definition at line 58 of file qcontainerfwd.h.
|
| QMultiHash () |
|
| QMultiHash (const QHash< Key, T > &other) |
|
void | swap (QMultiHash< Key, T > &other) |
|
QHash< Key, T >::iterator | replace (const Key &key, const T &value) |
|
QHash< Key, T >::iterator | insert (const Key &key, const T &value) |
|
QMultiHash & | operator+= (const QMultiHash &other) |
|
QMultiHash | operator+ (const QMultiHash &other) const |
|
bool | contains (const Key &key, const T &value) const |
|
int | remove (const Key &key, const T &value) |
|
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 >::const_iterator | constFind (const Key &key, const T &value) const |
|
| QHash () |
|
| QHash (const QHash< Key, T > &other) |
|
| ~QHash () |
|
QHash< Key, T > & | operator= (const QHash< Key, T > &other) |
|
void | swap (QHash< Key, T > &other) |
|
bool | operator== (const QHash< Key, T > &other) const |
|
bool | operator!= (const QHash< Key, T > &other) const |
|
int | size () const |
|
bool | isEmpty () const |
|
int | capacity () const |
|
void | reserve (int size) |
|
void | squeeze () |
|
void | detach () |
|
bool | isDetached () const |
|
void | setSharable (bool sharable) |
|
bool | isSharedWith (const QHash< Key, T > &other) const |
|
void | clear () |
|
int | remove (const Key &key) |
|
T | take (const Key &key) |
|
bool | contains (const Key &key) const |
|
const Key | key (const T &value) const |
|
const Key | key (const T &value, const Key &defaultKey) const |
|
const T | value (const Key &key) const |
|
const T | value (const Key &key, const T &defaultValue) const |
|
T & | operator[] (const Key &key) |
|
const T | operator[] (const Key &key) const |
|
QList< Key > | uniqueKeys () const |
|
QList< Key > | keys () const |
|
QList< Key > | keys (const T &value) const |
|
QList< T > | values () const |
|
QList< T > | values (const Key &key) const |
|
int | count (const Key &key) const |
|
iterator | begin () |
|
const_iterator | begin () const |
|
const_iterator | constBegin () const |
|
iterator | end () |
|
const_iterator | end () const |
|
const_iterator | constEnd () const |
|
iterator | erase (iterator it) |
|
int | count () const |
|
iterator | find (const Key &key) |
|
const_iterator | find (const Key &key) const |
|
const_iterator | constFind (const Key &key) const |
|
iterator | insert (const Key &key, const T &value) |
|
iterator | insertMulti (const Key &key, const T &value) |
|
QHash< Key, T > & | unite (const QHash< Key, T > &other) |
|
bool | empty () const |
|
Definition at line 929 of file qhash.h.
void swap(QHash< Key, T > &other)
QHash<Key, T>::iterator replace |
( |
const Key & |
key, |
|
|
const T & |
value |
|
) |
| |
|
inline |
Definition at line 931 of file qhash.h.
GLsizei const GLfloat * value
iterator insert(const Key &key, const T &value)
const Key key(const T &value) const
QHash<Key, T>::iterator insert |
( |
const Key & |
key, |
|
|
const T & |
value |
|
) |
| |
|
inline |
Definition at line 934 of file qhash.h.
GLsizei const GLfloat * value
iterator insertMulti(const Key &key, const T &value)
const Key key(const T &value) const
Definition at line 937 of file qhash.h.
938 { this->
unite(other);
return *
this; }
QHash< Key, T > & unite(const QHash< Key, T > &other)
Definition at line 939 of file qhash.h.
940 {
QMultiHash result = *
this; result += other;
return result; }
Q_INLINE_TEMPLATE bool contains |
( |
const Key & |
key, |
|
|
const T & |
value |
|
) |
| const |
Definition at line 1000 of file qhash.h.
QHash< Key, T >::const_iterator constFind(const Key &key, const T &value) const
GLsizei const GLfloat * value
const_iterator constEnd() const
const Key key(const T &value) const
Q_INLINE_TEMPLATE int remove |
( |
const Key & |
key, |
|
|
const T & |
value |
|
) |
| |
Definition at line 1006 of file qhash.h.
1011 while (i !=
end && i.key() ==
key) {
1012 if (i.value() ==
value) {
iterator erase(iterator it)
const T value(const Key &key) const
QHash< Key, T >::iterator find(const Key &key, const T &value)
const Key key(const T &value) const
Q_INLINE_TEMPLATE int count |
( |
const Key & |
key, |
|
|
const T & |
value |
|
) |
| const |
Definition at line 1023 of file qhash.h.
1028 while (i !=
end && i.key() ==
key) {
1029 if (i.value() ==
value)
QHash< Key, T >::const_iterator constFind(const Key &key, const T &value) const
const T value(const Key &key) const
const Key key(const T &value) const
QHash<Key, T>::iterator find |
( |
const Key & |
key, |
|
|
const T & |
value |
|
) |
| |
|
inline |
Definition at line 972 of file qhash.h.
975 while (i !=
end && i.key() ==
key) {
976 if (i.value() ==
value)
const T value(const Key &key) const
QHash< Key, T >::iterator find(const Key &key, const T &value)
const Key key(const T &value) const
Definition at line 982 of file qhash.h.
985 while (i !=
end && i.key() ==
key) {
986 if (i.value() ==
value)
QHash< Key, T >::const_iterator constFind(const Key &key, const T &value) const
const T value(const Key &key) const
const Key key(const T &value) const
Definition at line 992 of file qhash.h.
GLsizei const GLfloat * value
QHash< Key, T >::iterator find(const Key &key, const T &value)
const Key key(const T &value) const
The documentation for this class was generated from the following files: