#include <QtCore/qalgorithms.h>
#include <QtCore/qcontainertools_impl.h>
#include <QtCore/qhashfunctions.h>
#include <QtCore/qiterator.h>
#include <QtCore/qlist.h>
#include <QtCore/qrefcount.h>
#include <initializer_list>
#include <functional>
Go to the source code of this file.
|
struct | QHashDummyValue |
|
struct | QHashPrivate::Node< Key, T > |
|
struct | QHashPrivate::Node< Key, QHashDummyValue > |
|
struct | QHashPrivate::MultiNodeChain< T > |
|
struct | QHashPrivate::MultiNode< Key, T > |
|
struct | QHashPrivate::SpanConstants |
|
struct | QHashPrivate::Span< Node > |
|
struct | QHashPrivate::Span< Node >::Entry |
|
struct | QHashPrivate::Data< Node > |
|
struct | QHashPrivate::Data< Node >::Bucket |
|
struct | QHashPrivate::Data< Node >::InsertionResult |
|
struct | QHashPrivate::iterator< Node > |
|
class | QHash< Key, T > |
| \inmodule QtCore More...
|
|
class | QHash< Key, T >::iterator |
| \inmodule QtCore More...
|
|
class | QHash< Key, T >::const_iterator |
| \inmodule QtCore More...
|
|
class | QHash< Key, T >::key_iterator |
| \inmodule QtCore More...
|
|
class | QMultiHash< Key, T > |
| \inmodule QtCore More...
|
|
class | QMultiHash< Key, T >::iterator |
| \inmodule QtCore More...
|
|
class | QMultiHash< Key, T >::const_iterator |
| \inmodule QtCore More...
|
|
class | QMultiHash< Key, T >::key_iterator |
| \inmodule QtCore More...
|
|
|
template<typename T > |
size_t | QHashPrivate::calculateHash (const T &t, size_t seed=0) |
|
template<typename Node > |
constexpr bool | QHashPrivate::isRelocatable () |
|
constexpr size_t | QHashPrivate::GrowthPolicy::bucketsForCapacity (size_t requestedCapacity) noexcept |
|
constexpr size_t | QHashPrivate::GrowthPolicy::bucketForHash (size_t nBuckets, size_t hash) noexcept |
|
template<class Key , class T > |
size_t | qHash (const QHash< Key, T > &key, size_t seed=0) noexcept(noexcept(qHash(std::declval< Key & >())) &&noexcept(qHash(std::declval< T & >()))) |
|
template<class Key , class T > |
size_t | qHash (const QMultiHash< Key, T > &key, size_t seed=0) noexcept(noexcept(qHash(std::declval< Key & >())) &&noexcept(qHash(std::declval< T & >()))) |
|
template<typename Key , typename T , typename Predicate > |
qsizetype | erase_if (QHash< Key, T > &hash, Predicate pred) |
|
template<typename Key , typename T , typename Predicate > |
qsizetype | erase_if (QMultiHash< Key, T > &hash, Predicate pred) |
|
◆ erase_if() [1/2]
template<typename
Key , typename T , typename Predicate >
◆ erase_if() [2/2]
template<typename
Key , typename T , typename Predicate >
◆ qHash() [1/2]
template<class
Key , class T >
size_t qHash |
( |
const QHash< Key, T > & |
key, |
|
|
size_t |
seed = 0 |
|
) |
| |
|
related |
◆ qHash() [2/2]
template<class
Key , class T >
size_t qHash |
( |
const QMultiHash< Key, T > & |
key, |
|
|
size_t |
seed = 0 |
|
) |
| |
|
related |