内容

• 公共函数
• 详细描述

key_iterator 类

class QMultiHash ::key_iterator

QMultiHash::key_iterator 类提供 STL 样式 const 迭代器为 QMultiHash keys. 更多...

该类在 Qt 5.6 引入。

• 所有成员列表，包括继承成员

公共函数

const_iterator	base () const
bool	operator!= (key_iterator other ) const
const Key &	operator* () const
key_iterator &	operator++ ()
key_iterator	operator++ (int)
const Key *	operator-> () const
bool	operator== (key_iterator other ) const

详细描述

QMultiHash::key_iterator is essentially the same as QMultiHash::const_iterator with the difference that operator*() and operator->() return a key instead of a value.

For most uses QMultiHash::iterator and QMultiHash::const_iterator should be used, you can easily access the key by calling QMultiHash::iterator::key ():

for (QHash<int, QString>::const_iterator it = hash.cbegin(), end = hash.cend(); it != end; ++it) {
    cout << "The key: " << it.key() << Qt::endl
    cout << "The value: " << it.value() << Qt::endl;
    cout << "Also the value: " << (*it) << Qt::endl;
}
					

However, to have interoperability between QMultiHash 's keys and STL-style algorithms we need an iterator that dereferences to a key instead of a value. With QMultiHash::key_iterator we can apply an algorithm to a range of keys without having to call QMultiHash::keys (), which is inefficient as it costs one QMultiHash iteration and memory allocation to create a temporary QList .

// Inefficient, keys() is expensive
QList<int> keys = hash.keys();
int numPrimes = std::count_if(keys.cbegin(), keys.cend(), isPrimeNumber);
qDeleteAll(hash2.keys());
// Efficient, no memory allocation needed
int numPrimes = std::count_if(hash.keyBegin(), hash.keyEnd(), isPrimeNumber);
qDeleteAll(hash2.keyBegin(), hash2.keyEnd());
					

QMultiHash::key_iterator is const, it's not possible to modify the key.

默认 QMultiHash::key_iterator constructor creates an uninitialized iterator. You must initialize it using a QMultiHash function like QMultiHash::keyBegin () 或 QMultiHash::keyEnd ().

警告： Iterators on implicitly shared containers do not work exactly like STL-iterators. You should avoid copying a container while iterators are active on that container. For more information, read 隐式共享迭代器问题 .

另请参阅 QMultiHash::const_iterator and QMultiHash::iterator .

成员函数文档编制

const_iterator key_iterator:: base () const

Returns the underlying const_iterator this key_iterator is based on.

bool key_iterator:: operator!= ( key_iterator other ) const

返回 true if other 指向与此迭代器不同的项；否则返回 false .

另请参阅 operator== ().

const Key &key_iterator:: operator* () const

Returns the current item's key.

key_iterator &key_iterator:: operator++ ()

The prefix ++ operator ( ++i ) advances the iterator to the next item in the hash and returns an iterator to the new current item.

Calling this function on QMultiHash::keyEnd () leads to undefined results.

key_iterator key_iterator:: operator++ ( int )

这是重载函数。

The postfix ++ operator ( i++ ) advances the iterator to the next item in the hash and returns an iterator to the previous item.

const Key *key_iterator:: operator-> () const

Returns a pointer to the current item's key.

bool key_iterator:: operator== ( key_iterator other ) const

返回 true if other points to the same item as this iterator; otherwise returns false .

另请参阅 operator!= ().