KDbUtils::AutodeletedHash-members

Search for usage in LXR

KDbUtils::AutodeletedHash< Key, T > Member List

This is the complete list of members for KDbUtils::AutodeletedHash< Key, T >, including all inherited members.

autoDelete() const (defined in KDbUtils::AutodeletedHash< Key, T >)KDbUtils::AutodeletedHash< Key, T >inline
AutodeletedHash(const AutodeletedHash &other)KDbUtils::AutodeletedHash< Key, T >inline
AutodeletedHash(bool autoDelete=true)KDbUtils::AutodeletedHash< Key, T >inline
begin()QHash< Key, T >
begin() const constQHash< Key, T >
capacity() const constQHash< Key, T >
cbegin() const constQHash< Key, T >
cend() const constQHash< Key, T >
clear() (defined in KDbUtils::AutodeletedHash< Key, T >)KDbUtils::AutodeletedHash< Key, T >inline
const_key_value_iteratorQHash< Key, T >
constBegin() const constQHash< Key, T >
constEnd() const constQHash< Key, T >
constFind(const Key &key) const constQHash< Key, T >
ConstIteratorQHash< Key, T >
constKeyValueBegin() const constQHash< Key, T >
constKeyValueEnd() const constQHash< Key, T >
contains(const Key &key) const constQHash< Key, T >
count(const Key &key) const constQHash< Key, T >
count() const constQHash< Key, T >
difference_typeQHash< Key, T >
empty() const constQHash< Key, T >
end()QHash< Key, T >
end() const constQHash< Key, T >
equal_range(const Key &key)QHash< Key, T >
equal_range(const Key &key) const constQHash< Key, T >
erase(typename QHash< Key, T >::iterator pos) (defined in KDbUtils::AutodeletedHash< Key, T >)KDbUtils::AutodeletedHash< Key, T >inline
QHash< Key, T >::erase(QHash::iterator pos)QHash< Key, T >
QHash< Key, T >::erase(QHash::const_iterator pos)QHash< Key, T >
find(const Key &key)QHash< Key, T >
find(const Key &key) const constQHash< Key, T >
insert(const Key &key, const T &value) (defined in KDbUtils::AutodeletedHash< Key, T >)KDbUtils::AutodeletedHash< Key, T >inline
QHash< Key, T >::insert(const QHash< K, V > &other)QHash< Key, T >
insertMulti(const Key &key, const T &value)QHash< Key, T >
isEmpty() const constQHash< Key, T >
IteratorQHash< Key, T >
key(const T &value) const constQHash< Key, T >
key(const T &value, const Key &defaultKey) const constQHash< Key, T >
key_typeQHash< Key, T >
key_value_iteratorQHash< Key, T >
keyBegin() const constQHash< Key, T >
keyEnd() const constQHash< Key, T >
keys() const constQHash< Key, T >
keys(const T &value) const constQHash< Key, T >
keyValueBegin()QHash< Key, T >
keyValueBegin() const constQHash< Key, T >
keyValueEnd()QHash< Key, T >
keyValueEnd() const constQHash< Key, T >
mapped_typeQHash< Key, T >
operator!=(const QHash< K, V > &other) const constQHash< Key, T >
operator<<(QDataStream &out, const QHash< Key, T > &hash)QHash< Key, T >
operator=(const QHash< K, V > &other)QHash< Key, T >
operator=(QHash< K, V > &&other)QHash< Key, T >
operator==(const QHash< K, V > &other) const constQHash< Key, T >
operator>>(QDataStream &in, QHash< Key, T > &hash)QHash< Key, T >
operator[](const Key &key)QHash< Key, T >
operator[](const Key &key) const constQHash< Key, T >
qGlobalQHashSeed()QHash< Key, T >
qHash(const QUrl &url, uint seed)QHash< Key, T >
qHash(const QDateTime &key, uint seed)QHash< Key, T >
qHash(const QDate &key, uint seed)QHash< Key, T >
qHash(const QTime &key, uint seed)QHash< Key, T >
qHash(const QPair< T1, T2 > &key, uint seed)QHash< Key, T >
qHash(const std::pair< T1, T2 > &key, uint seed)QHash< Key, T >
qHash(char key, uint seed)QHash< Key, T >
qHash(uchar key, uint seed)QHash< Key, T >
qHash(signed char key, uint seed)QHash< Key, T >
qHash(ushort key, uint seed)QHash< Key, T >
qHash(short key, uint seed)QHash< Key, T >
qHash(uint key, uint seed)QHash< Key, T >
qHash(int key, uint seed)QHash< Key, T >
qHash(ulong key, uint seed)QHash< Key, T >
qHash(long key, uint seed)QHash< Key, T >
qHash(quint64 key, uint seed)QHash< Key, T >
qHash(qint64 key, uint seed)QHash< Key, T >
qHash(float key, uint seed)QHash< Key, T >
qHash(double key, uint seed)QHash< Key, T >
qHash(long double key, uint seed)QHash< Key, T >
qHash(const QChar key, uint seed)QHash< Key, T >
qHash(const QByteArray &key, uint seed)QHash< Key, T >
qHash(const QBitArray &key, uint seed)QHash< Key, T >
qHash(const QString &key, uint seed)QHash< Key, T >
qHash(const QStringRef &key, uint seed)QHash< Key, T >
qHash(QLatin1String key, uint seed)QHash< Key, T >
qHash(const T *key, uint seed)QHash< Key, T >
qHash(const QHash< Key, T > &key, uint seed)QHash< Key, T >
qHash(const QSet< T > &key, uint seed)QHash< Key, T >
qHash(const QVersionNumber &key, uint seed)QHash< Key, T >
QHash()QHash< Key, T >
QHash(std::initializer_list< std::pair< Key, T > > list)QHash< Key, T >
QHash(const QHash< K, V > &other)QHash< Key, T >
QHash(QHash< K, V > &&other)QHash< Key, T >
QHash(InputIterator begin, InputIterator end)QHash< Key, T >
qHashBits(const void *p, size_t len, uint seed)QHash< Key, T >
qHashRange(InputIterator first, InputIterator last, uint seed)QHash< Key, T >
qHashRangeCommutative(InputIterator first, InputIterator last, uint seed)QHash< Key, T >
qSetGlobalQHashSeed(int newSeed)QHash< Key, T >
remove(const Key &key) (defined in KDbUtils::AutodeletedHash< Key, T >)KDbUtils::AutodeletedHash< Key, T >inline
reserve(int size)QHash< Key, T >
setAutoDelete(bool set) (defined in KDbUtils::AutodeletedHash< Key, T >)KDbUtils::AutodeletedHash< Key, T >inline
size() const constQHash< Key, T >
size_typeQHash< Key, T >
squeeze()QHash< Key, T >
swap(QHash< K, V > &other)QHash< Key, T >
take(const Key &key)QHash< Key, T >
uniqueKeys() const constQHash< Key, T >
unite(const QHash< K, V > &other)QHash< Key, T >
value(const Key &key) const constQHash< Key, T >
value(const Key &key, const T &defaultValue) const constQHash< Key, T >
values() const constQHash< Key, T >
values(const Key &key) const constQHash< Key, T >
~AutodeletedHash() (defined in KDbUtils::AutodeletedHash< Key, T >)KDbUtils::AutodeletedHash< Key, T >inline
~QHash()QHash< Key, T >
This file is part of the KDE documentation.
Documentation copyright © 1996-2024 The KDE developers.
Generated on Sun Feb 25 2024 18:47:38 by doxygen 1.10.0 written by Dimitri van Heesch, © 1997-2006

KDE's Doxygen guidelines are available online.