|
| RequiredPropertiesAndTarget (QObject *target) |
|
| RequiredPropertiesAndTarget (const RequiredPropertiesAndTarget &)=default |
|
| RequiredPropertiesAndTarget (RequiredPropertiesAndTarget &&)=default |
|
RequiredPropertiesAndTarget & | operator= (const RequiredPropertiesAndTarget &)=default |
|
RequiredPropertiesAndTarget & | operator= (RequiredPropertiesAndTarget &&)=default |
|
| QHash () noexcept=default |
| Constructs an empty hash.
|
|
| QHash (std::initializer_list< std::pair< RequiredPropertyKey, RequiredPropertyInfo > > list) |
|
| QHash (const QHash &other) noexcept |
| Constructs a copy of other.
|
|
| QHash (QHash &&other) noexcept |
| Move-constructs a QHash instance, making it point at the same object that other was pointing to.
|
|
| QHash (InputIterator f, InputIterator l) |
|
| QHash (InputIterator f, InputIterator l) |
|
| ~QHash () |
| Destroys the hash.
|
|
QHash & | operator= (const QHash &other) noexcept(std::is_nothrow_destructible< Node >::value) |
| Assigns other to this hash and returns a reference to this hash.
|
|
void | swap (QHash &other) noexcept |
|
bool | remove (const K &key) |
|
qsizetype | removeIf (Predicate pred) |
|
RequiredPropertyInfo | take (const RequiredPropertyKey &key) |
| Removes the item with the key from the hash and returns the value associated with it.
|
|
RequiredPropertyInfo | take (const K &key) |
|
bool | contains (const RequiredPropertyKey &key) const noexcept |
| Returns true if the hash contains an item with the key; otherwise returns false .
|
|
bool | contains (const K &key) const |
|
qsizetype | count (const RequiredPropertyKey &key) const noexcept |
| Returns the number of items associated with the key.
|
|
qsizetype | count () const noexcept |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.Same as size().
|
|
qsizetype | count (const K &key) const |
|
RequiredPropertyKey | key (const RequiredPropertyInfo &value) const noexcept |
|
RequiredPropertyKey | key (const RequiredPropertyInfo &value, const RequiredPropertyKey &defaultKey) const noexcept |
|
RequiredPropertyInfo | value (const RequiredPropertyKey &key) const noexcept |
|
RequiredPropertyInfo | value (const RequiredPropertyKey &key, const RequiredPropertyInfo &defaultValue) const noexcept |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.Returns the value associated with the key.
|
|
RequiredPropertyInfo | value (const K &key) const noexcept |
|
RequiredPropertyInfo | value (const K &key, const RequiredPropertyInfo &defaultValue) const noexcept |
|
RequiredPropertyInfo & | operator[] (const RequiredPropertyKey &key) |
| Returns the value associated with the key as a modifiable reference.
|
|
const RequiredPropertyInfo | operator[] (const RequiredPropertyKey &key) const noexcept |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.Same as value().
|
|
RequiredPropertyInfo & | operator[] (const K &key) |
|
const RequiredPropertyInfo | operator[] (const K &key) const noexcept |
|
QList< RequiredPropertyKey > | keys () const |
| Returns a list containing all the keys in the hash, in an arbitrary order.
|
|
QList< RequiredPropertyKey > | keys (const RequiredPropertyInfo &value) const |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.Returns a list containing all the keys associated with value value, in an arbitrary order.
|
|
QList< RequiredPropertyInfo > | values () const |
| Returns a list containing all the values in the hash, in an arbitrary order.
|
|
iterator | begin () |
| Returns an \l{STL-style iterators}{STL-style iterator} pointing to the first item in the hash.
|
|
const_iterator | begin () const noexcept |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
|
|
const_iterator | cbegin () const noexcept |
|
const_iterator | constBegin () const noexcept |
| Returns a const \l{STL-style iterators}{STL-style iterator} pointing to the first item in the hash.
|
|
iterator | end () noexcept |
| Returns an \l{STL-style iterators}{STL-style iterator} pointing to the imaginary item after the last item in the hash.
|
|
const_iterator | end () const noexcept |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
|
|
const_iterator | cend () const noexcept |
|
const_iterator | constEnd () const noexcept |
| Returns a const \l{STL-style iterators}{STL-style iterator} pointing to the imaginary item after the last item in the hash.
|
|
key_iterator | keyBegin () const noexcept |
|
key_iterator | keyEnd () const noexcept |
|
key_value_iterator | keyValueBegin () |
|
const_key_value_iterator | keyValueBegin () const noexcept |
|
key_value_iterator | keyValueEnd () |
|
const_key_value_iterator | keyValueEnd () const noexcept |
|
const_key_value_iterator | constKeyValueBegin () const noexcept |
|
const_key_value_iterator | constKeyValueEnd () const noexcept |
|
auto | asKeyValueRange () & |
|
auto | asKeyValueRange () const & |
|
auto | asKeyValueRange () && |
|
auto | asKeyValueRange () const && |
|
iterator | erase (const_iterator it) |
|
std::pair< iterator, iterator > | equal_range (const RequiredPropertyKey &key) |
|
std::pair< const_iterator, const_iterator > | equal_range (const RequiredPropertyKey &key) const noexcept |
|
std::pair< iterator, iterator > | equal_range (const K &key) |
|
std::pair< const_iterator, const_iterator > | equal_range (const K &key) const noexcept |
|
iterator | find (const RequiredPropertyKey &key) |
| Returns an iterator pointing to the item with the key in the hash.
|
|
const_iterator | find (const RequiredPropertyKey &key) const noexcept |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
|
|
iterator | find (const K &key) |
|
const_iterator | find (const K &key) const noexcept |
|
const_iterator | constFind (const RequiredPropertyKey &key) const noexcept |
|
const_iterator | constFind (const K &key) const noexcept |
|
iterator | insert (const RequiredPropertyKey &key, const RequiredPropertyInfo &value) |
| Inserts a new item with the key and a value of value.
|
|
void | insert (const QHash &hash) |
|
iterator | emplace (const RequiredPropertyKey &key, Args &&... args) |
|
iterator | emplace (RequiredPropertyKey &&key, Args &&... args) |
| Inserts a new element into the container.
|
|
TryEmplaceResult | tryEmplace (const RequiredPropertyKey &key, Args &&...args) |
| \variable QHash::TryEmplaceResult::iterator
|
|
TryEmplaceResult | tryEmplace (RequiredPropertyKey &&key, Args &&...args) |
|
TryEmplaceResult | tryEmplace (K &&key, Args &&...args) |
|
TryEmplaceResult | tryInsert (const RequiredPropertyKey &key, const RequiredPropertyInfo &value) |
|
TryEmplaceResult | tryInsert (K &&key, const RequiredPropertyInfo &value) |
|
std::pair< key_value_iterator, bool > | try_emplace (const RequiredPropertyKey &key, Args &&...args) |
|
std::pair< key_value_iterator, bool > | try_emplace (RequiredPropertyKey &&key, Args &&...args) |
|
key_value_iterator | try_emplace (const_iterator, const RequiredPropertyKey &key, Args &&...args) |
|
key_value_iterator | try_emplace (const_iterator, RequiredPropertyKey &&key, Args &&...args) |
|
std::pair< key_value_iterator, bool > | try_emplace (K &&key, Args &&...args) |
|
key_value_iterator | try_emplace (const_iterator, K &&key, Args &&...args) |
|
TryEmplaceResult | insertOrAssign (const RequiredPropertyKey &key, Value &&value) |
|
TryEmplaceResult | insertOrAssign (RequiredPropertyKey &&key, Value &&value) |
|
TryEmplaceResult | insertOrAssign (K &&key, Value &&value) |
|
std::pair< key_value_iterator, bool > | insert_or_assign (const RequiredPropertyKey &key, Value &&value) |
|
std::pair< key_value_iterator, bool > | insert_or_assign (RequiredPropertyKey &&key, Value &&value) |
|
key_value_iterator | insert_or_assign (const_iterator, const RequiredPropertyKey &key, Value &&value) |
|
key_value_iterator | insert_or_assign (const_iterator, RequiredPropertyKey &&key, Value &&value) |
|
std::pair< key_value_iterator, bool > | insert_or_assign (K &&key, Value &&value) |
|
key_value_iterator | insert_or_assign (const_iterator, K &&key, Value &&value) |
|
float | load_factor () const noexcept |
| Returns the current load factor of the QHash's internal hash table.
|
|
size_t | bucket_count () const noexcept |
|
bool | empty () const noexcept |
| This function is provided for STL compatibility.
|
|
|
using | key_type |
| Typedef for Key.
|
|
using | mapped_type |
| Typedef for T.
|
|
using | value_type |
|
using | size_type |
| Typedef for int.
|
|
using | difference_type |
| Typedef for ptrdiff_t.
|
|
using | reference |
|
using | const_reference |
|
typedef QKeyValueIterator< const RequiredPropertyKey &, const RequiredPropertyInfo &, const_iterator > | const_key_value_iterator |
| \inmodule QtCore
|
|
typedef QKeyValueIterator< const RequiredPropertyKey &, RequiredPropertyInfo &, iterator > | key_value_iterator |
| \inmodule QtCore
|
|
typedef iterator | Iterator |
| Qt-style synonym for QHash::iterator.
|
|
typedef const_iterator | ConstIterator |
| Qt-style synonym for QHash::const_iterator.
|
|
static float | max_load_factor () noexcept |
|
static size_t | max_bucket_count () noexcept |
|
template< typename... RequiredPropertyInfo > size_t | qHashMulti (size_t seed, const RequiredPropertyInfo &...args) |
|
template< typename... RequiredPropertyInfo > size_t | qHashMultiCommutative (size_t seed, const RequiredPropertyInfo &...args) |
|
template< typename InputIterator > size_t | qHashRange (InputIterator first, InputIterator last, size_t seed=0) |
|
template< typename InputIterator > size_t | qHashRangeCommutative (InputIterator first, InputIterator last, size_t seed=0) |
|
size_t | qHashBits (const void *p, size_t len, size_t seed=0) |
|
template< typename RequiredPropertyInfo > bool | qHashEquals (const RequiredPropertyInfo &a, const RequiredPropertyInfo &b) |
|
template< class RequiredPropertyKey, class RequiredPropertyInfo > QDataStream & | operator<< (QDataStream &out, const QHash< RequiredPropertyKey, RequiredPropertyInfo > &hash) |
| Writes the hash hash to stream out.
|
|
template< class RequiredPropertyKey, class RequiredPropertyInfo > QDataStream & | operator>> (QDataStream &in, QHash< RequiredPropertyKey, RequiredPropertyInfo > &hash) |
| Reads a hash from stream in into hash.
|
|
template< typename RequiredPropertyKey, typename RequiredPropertyInfo, typename Predicate > qsizetype | erase_if (QHash< RequiredPropertyKey, RequiredPropertyInfo > &hash, Predicate pred) |
|
size_t | qHash (const QGeoCoordinate &coordinate, size_t seed=0) |
| Returns a hash value for coordinate, using seed to seed the calculation.
|
|
template< typename... RequiredPropertyInfo > size_t | qHashMulti (size_t seed, const RequiredPropertyInfo &...args) |
|
template< typename... RequiredPropertyInfo > size_t | qHashMultiCommutative (size_t seed, const RequiredPropertyInfo &...args) |
|
template< typename InputIterator > size_t | qHashRange (InputIterator first, InputIterator last, size_t seed=0) |
|
template< typename InputIterator > size_t | qHashRangeCommutative (InputIterator first, InputIterator last, size_t seed=0) |
|
size_t | qHashBits (const void *p, size_t len, size_t seed=0) |
|
template< typename RequiredPropertyInfo > bool | qHashEquals (const RequiredPropertyInfo &a, const RequiredPropertyInfo &b) |
|
template< class RequiredPropertyKey, class RequiredPropertyInfo > QDataStream & | operator<< (QDataStream &out, const QHash< RequiredPropertyKey, RequiredPropertyInfo > &hash) |
| Writes the hash hash to stream out.
|
|
template< class RequiredPropertyKey, class RequiredPropertyInfo > QDataStream & | operator>> (QDataStream &in, QHash< RequiredPropertyKey, RequiredPropertyInfo > &hash) |
| Reads a hash from stream in into hash.
|
|
template< typename RequiredPropertyKey, typename RequiredPropertyInfo, typename Predicate > qsizetype | erase_if (QHash< RequiredPropertyKey, RequiredPropertyInfo > &hash, Predicate pred) |
|
size_t | qHash (const QGeoCoordinate &coordinate, size_t seed=0) |
| Returns a hash value for coordinate, using seed to seed the calculation.
|
|