QMap 類是提供基於紅-黑-樹的字典的模闆類。 更多...
| 頭： | #include <QMap> |
| qmake: | QT += core |
| 繼承者： |
注意： 此類的所有函數 可重入 .
| class | const_iterator |
| class | iterator |
| class | key_iterator |
| typedef | ConstIterator |
| typedef | Iterator |
| typedef | const_key_value_iterator |
| typedef | difference_type |
| typedef | key_type |
| typedef | key_value_iterator |
| typedef | mapped_type |
| typedef | size_type |
| QMap (const typename std::map<Key, T> & other ) | |
| QMap (QMap<Key, T> && other ) | |
| QMap (const QMap<Key, T> & other ) | |
| QMap (std::initializer_list<std::pair<Key, T>> list ) | |
| QMap () | |
| QMap<Key, T> & | operator= (QMap<Key, T> && other ) |
| QMap<Key, T> & | operator= (const QMap<Key, T> & other ) |
| ~QMap () | |
| QMap::iterator | begin () |
| QMap::const_iterator | begin () const |
| QMap::const_iterator | cbegin () const |
| QMap::const_iterator | cend () const |
| void | clear () |
| QMap::const_iterator | constBegin () const |
| QMap::const_iterator | constEnd () const |
| QMap::const_iterator | constFind (const Key & key ) const |
| QMap::const_key_value_iterator | constKeyValueBegin () const |
| QMap::const_key_value_iterator | constKeyValueEnd () const |
| bool | contains (const Key & key ) const |
| int | count (const Key & key ) const |
| int | count () const |
| bool | empty () const |
| QMap::iterator | end () |
| QMap::const_iterator | end () const |
| QPair<QMap::iterator, QMap::iterator> | equal_range (const Key & key ) |
| QPair<QMap::const_iterator, QMap::const_iterator> | equal_range (const Key & key ) const |
| QMap::iterator | erase (QMap::iterator pos ) |
| QMap::iterator | find (const Key & key ) |
| QMap::const_iterator | find (const Key & key ) const |
| T & | first () |
| const T & | first () const |
| const Key & | firstKey () const |
| QMap::iterator | insert (const Key & key , const T & value ) |
| QMap::iterator | insert (QMap::const_iterator pos , const Key & key , const T & value ) |
| void | insert (const QMap<Key, T> & map ) |
| bool | isEmpty () const |
| const Key | key (const T & value , const Key & defaultKey = Key()) const |
| QMap::key_iterator | keyBegin () const |
| QMap::key_iterator | keyEnd () const |
| QMap::key_value_iterator | keyValueBegin () |
| QMap::const_key_value_iterator | keyValueBegin () const |
| QMap::key_value_iterator | keyValueEnd () |
| QMap::const_key_value_iterator | keyValueEnd () const |
| QList<Key> | keys () const |
| QList<Key> | keys (const T & value ) const |
| T & | last () |
| const T & | last () const |
| const Key & | lastKey () const |
| QMap::iterator | lowerBound (const Key & key ) |
| QMap::const_iterator | lowerBound (const Key & key ) const |
| int | remove (const Key & key ) |
| int | size () const |
| void | swap (QMap<Key, T> & other ) |
| T | take (const Key & key ) |
| std::map<Key, T> | toStdMap () const |
| QMap::iterator | upperBound (const Key & key ) |
| QMap::const_iterator | upperBound (const Key & key ) const |
| const T | value (const Key & key , const T & defaultValue = T()) const |
| QList<T> | values () const |
| bool | operator!= (const QMap<Key, T> & other ) const |
| bool | operator== (const QMap<Key, T> & other ) const |
| T & | operator[] (const Key & key ) |
| const T | operator[] (const Key & key ) const |
| QDataStream & | operator<< (QDataStream & out , const QMap<Key, T> & map ) |
| QDataStream & | operator>> (QDataStream & in , QMap<Key, T> & map ) |
QMap<Key, T> 是一種 Qt 一般 容器類 。它存儲 (鍵, 值) 對並提供鍵關聯值的快速查找。
QMap 和 QHash 提供非常類似的功能。差異是：
這裏是 QMap 範例具有
QString
鍵和
int
值：
QMap<QString, int> map;
要將 (key, value) 對插入映射，可以使用 operator[]()：
map["one"] = 1; map["three"] = 3; map["seven"] = 7;
This inserts the following three (key, value) pairs into the QMap: ("one", 1), ("three", 3), and ("seven", 7). Another way to insert items into the map is to use insert ():
map.insert("twelve", 12);
要查找值，使用 operator[]() 或 value ():
int num1 = map["thirteen"]; int num2 = map.value("thirteen");
If there is no item with the specified key in the map, these functions return a 默認構造值 .
If you want to check whether the map contains a certain key, use contains ():
int timeout = 30; if (map.contains("TIMEOUT")) timeout = map.value("TIMEOUT");
There is also a value () overload that uses its second argument as a default value if there is no item with the specified key:
int timeout = map.value("TIMEOUT", 30);
In general, we recommend that you use contains () 和 value () rather than operator[]() for looking up a key in a map. The reason is that operator[]() silently inserts an item into the map if no item exists with the same key (unless the map is const). For example, the following code snippet will create 1000 items in memory:
// WRONG QMap<int, QWidget *> map; ... for (int i = 0; i < 1000; ++i) { if (map[i] == okButton) cout << "Found button at index " << i << Qt::endl; }
要避免此問題，替換
map[i]
with
map.value(i)
在以上代碼中。
If you want to navigate through all the (key, value) pairs stored in a QMap, you can use an iterator. QMap provides both Java 風格迭代器 ( QMapIterator and QMutableMapIterator ) 和 STL 樣式迭代器 ( QMap::const_iterator and QMap::iterator ). Here's how to iterate over a QMap< QString , int> using a Java-style iterator:
QMapIterator<QString, int> i(map); while (i.hasNext()) { i.next(); cout << i.key() << ": " << i.value() << Qt::endl; }
Here's the same code, but using an STL-style iterator this time:
QMap<QString, int>::const_iterator i = map.constBegin(); while (i != map.constEnd()) { cout << i.key() << ": " << i.value() << Qt::endl; ++i; }
The items are traversed in ascending key order.
Normally, a QMap allows only one value per key. If you call insert () with a key that already exists in the QMap, the previous value will be erased. For example:
map.insert("plenty", 100); map.insert("plenty", 2000); // map.value("plenty") == 2000
However, you can store multiple values per key by using using the subclass QMultiMap . If you want to retrieve all the values for a single key, you can use values(const Key &key), which returns a QList <T>:
QList<int> values = map.values("plenty"); for (int i = 0; i < values.size(); ++i) cout << values.at(i) << Qt::endl;
The items that share the same key are available from most recently to least recently inserted. Another approach is to call find () to get the STL-style iterator for the first item with a key and iterate from there:
QMap<QString, int>::iterator i = map.find("plenty"); while (i != map.end() && i.key() == "plenty") { cout << i.value() << Qt::endl; ++i; }
If you only need to extract the values from a map (not the keys), you can also use foreach :
QMap<QString, int> map; ... foreach (int value, map) cout << value << Qt::endl;
Items can be removed from the map in several ways. One way is to call remove (); this will remove any item with the given key. Another way is to use QMutableMapIterator::remove (). In addition, you can clear the entire map using clear ().
QMap's key and value data types must be
可賦值數據類型
. This covers most data types you are likely to encounter, but the compiler won't let you, for example, store a
QWidget
作為值；取而代之，存儲
QWidget
*. In addition, QMap's key type must provide operator<(). QMap uses it to keep its items sorted, and assumes that two keys
x
and
y
are equal if neither
x < y
nor
y < x
為 true。
範例：
#ifndef EMPLOYEE_H #define EMPLOYEE_H class Employee { public: Employee() {} Employee(const QString &name, QDate dateOfBirth); ... private: QString myName; QDate myDateOfBirth; }; inline bool operator<(const Employee &e1, const Employee &e2) { if (e1.name() != e2.name()) return e1.name() < e2.name(); return e1.dateOfBirth() < e2.dateOfBirth(); } #endif // EMPLOYEE_H
In the example, we start by comparing the employees' names. If they're equal, we compare their dates of birth to break the tie.
另請參閱 QMapIterator , QMutableMapIterator , QHash ，和 QSet .
Qt 樣式同義詞 QMap <Key, T>::const_iterator.
Qt 樣式同義詞 QMap <Key, T>::iterator.
The QMap::const_key_value_iterator typedef provides an STL-style iterator for QMap and QMultiMap .
QMap::const_key_value_iterator is essentially the same as QMap::const_iterator with the difference that operator*() returns a key/value pair instead of a value.
該 typedef 在 Qt 5.10 引入。
另請參閱 QKeyValueIterator .
typedef 對於 ptrdiff_t。為兼容 STL 提供。
typedef 對於 Key。為兼容 STL 提供。
The QMap::key_value_iterator typedef provides an STL-style iterator for QMap and QMultiMap .
QMap::key_value_iterator is essentially the same as QMap::iterator with the difference that operator*() returns a key/value pair instead of a value.
該 typedef 在 Qt 5.10 引入。
另請參閱 QKeyValueIterator .
typedef 對於 T。為兼容 STL 提供。
typedef 對於 int。為兼容 STL 提供。
構造副本為 other .
另請參閱 toStdMap ().
Move-constructs a QMap instance, making it point at the same object that other 所指嚮的。
該函數在 Qt 5.2 引入。
構造副本為 other .
This operation occurs in 常量時間 , because QMap is 隱式共享 . This makes returning a QMap from a function very fast. If a shared instance is modified, it will be copied (copy-on-write), and this takes 綫性時間 .
另請參閱 operator= ().
Constructs a map with a copy of each of the elements in the initializer list list .
This function is only available if the program is being compiled in C++11 mode.
該函數在 Qt 5.1 引入。
Constructs an empty map.
另請參閱 clear ().
移動賦值 other 到此 QMap 實例。
該函數在 Qt 5.2 引入。
賦值 other to this map and returns a reference to this map.
Destroys the map. References to the values in the map, and all iterators over this map, become invalid.
返迴 STL 樣式迭代器 pointing to the first item in the map.
另請參閱 constBegin () 和 end ().
這是重載函數。
返迴常量 STL 樣式迭代器 pointing to the first item in the map.
該函數在 Qt 5.0 引入。
返迴常量 STL 樣式迭代器 pointing to the imaginary item after the last item in the map.
該函數在 Qt 5.0 引入。
Removes all items from the map.
另請參閱 remove ().
返迴常量 STL 樣式迭代器 pointing to the first item in the map.
返迴常量 STL 樣式迭代器 pointing to the imaginary item after the last item in the map.
另請參閱 constBegin () 和 end ().
Returns an const iterator pointing to the item with key key in the map.
If the map contains no item with key key ，函數返迴 constEnd ().
該函數在 Qt 4.1 引入。
另請參閱 find () 和 QMultiMap::constFind ().
返迴常量 STL 樣式迭代器 pointing to the first entry in the map.
該函數在 Qt 5.10 引入。
另請參閱 keyValueBegin ().
返迴常量 STL 樣式迭代器 pointing to the imaginary entry after the last entry in the map.
該函數在 Qt 5.10 引入。
另請參閱 constKeyValueBegin ().
返迴
true
if the map contains an item with key
key
；否則返迴
false
.
另請參閱 count () 和 QMultiMap::contains ().
Returns the number of items associated with key key .
另請參閱 contains () 和 QMultiMap::count ().
這是重載函數。
如同 size ().
此函數為兼容 STL (標準模闆庫) 提供。它相當於 isEmpty (), returning true if the map is empty; otherwise returning false.
返迴 STL 樣式迭代器 pointing to the imaginary item after the last item in the map.
這是重載函數。
Returns a pair of iterators delimiting the range of values
[first, second)
, that are stored under
key
.
這是重載函數。
該函數在 Qt 5.6 引入。
Removes the (key, value) pair pointed to by the iterator pos from the map, and returns an iterator to the next item in the map.
另請參閱 remove ().
Returns an iterator pointing to the item with key key in the map.
If the map contains no item with key key ，函數返迴 end ().
If the map contains multiple items with key key , this function returns an iterator that points to the most recently inserted value. The other values are accessible by incrementing the iterator. For example, here's some code that iterates over all the items with the same key:
QMap<QString, int> map; ... QMap<QString, int>::const_iterator i = map.find("HDR"); while (i != map.end() && i.key() == "HDR") { cout << i.value() << Qt::endl; ++i; }
另請參閱 constFind (), value (), values (), lowerBound (), upperBound ()，和 QMultiMap::find ().
這是重載函數。
Returns a reference to the first value in the map, that is the value mapped to the smallest key. This function assumes that the map is not empty.
When unshared (or const version is called), this executes in 常量時間 .
該函數在 Qt 5.2 引入。
另請參閱 last (), firstKey ()，和 isEmpty ().
這是重載函數。
該函數在 Qt 5.2 引入。
Returns a reference to the smallest key in the map. This function assumes that the map is not empty.
This executes in 常量時間 .
該函數在 Qt 5.2 引入。
另請參閱 lastKey (), first (), keyBegin ()，和 isEmpty ().
Inserts a new item with the key key 和值 value .
If there is already an item with the key key , that item's value is replaced with value .
If there are multiple items with the key key , the most recently inserted item's value is replaced with value .
另請參閱 QMultiMap::insert ().
這是重載函數。
Inserts a new item with the key key and value value and with hint pos suggesting where to do the insert.
若 constBegin () is used as hint it indicates that the key is less than any key in the map while constEnd () suggests that the key is (strictly) larger than any key in the map. Otherwise the hint should meet the condition ( pos - 1). key () < key <= pos. key (). If the hint pos is wrong it is ignored and a regular insert is done.
If there is already an item with the key key , that item's value is replaced with value .
If there are multiple items with the key key , then exactly one of them is replaced with value .
If the hint is correct and the map is unshared, the insert executes in amortized 常量時間 .
When creating a map from sorted data inserting the largest key first with constBegin () is faster than inserting in sorted order with constEnd (), since constEnd () - 1 (which is needed to check if the hint is valid) needs logarithmic time .
注意： Be careful with the hint. Providing an iterator from an older shared instance might crash but there is also a risk that it will silently corrupt both the map and the pos map.
該函數在 Qt 5.1 引入。
另請參閱 QMultiMap::insert ().
插入所有項在 map 進此映射。
If a key is common to both maps, its value will be replaced with the value stored in map .
注意： 若 map contains multiple entries with the same key then the final value of the key is undefined.
該函數在 Qt 5.15 引入。
另請參閱 QMultiMap::insert ().
返迴
true
若映射不包含項；否則返迴 false。
另請參閱 size ().
這是重載函數。
返迴第 1 個鍵具有值 value ，或 defaultKey if the map contains no item with value value . If no defaultKey is provided the function returns a default-constructed key .
此函數可能很慢 ( 綫性時間 )，因為 QMap 's internal data structure is optimized for fast lookup by key, not by value.
該函數在 Qt 4.3 引入。
返迴常量 STL 樣式迭代器 pointing to the first key in the map.
該函數在 Qt 5.6 引入。
返迴常量 STL 樣式迭代器 pointing to the imaginary item after the last key in the map.
該函數在 Qt 5.6 引入。
另請參閱 keyBegin () 和 lastKey ().
返迴 STL 樣式迭代器 pointing to the first entry in the map.
該函數在 Qt 5.10 引入。
另請參閱 keyValueEnd ().
返迴常量 STL 樣式迭代器 pointing to the first entry in the map.
該函數在 Qt 5.10 引入。
另請參閱 keyValueEnd ().
返迴 STL 樣式迭代器 pointing to the imaginary entry after the last entry in the map.
該函數在 Qt 5.10 引入。
另請參閱 keyValueBegin ().
返迴常量 STL 樣式迭代器 pointing to the imaginary entry after the last entry in the map.
該函數在 Qt 5.10 引入。
另請參閱 keyValueBegin ().
Returns a list containing all the keys in the map in ascending order. Keys that occur multiple times in the map (because the method is operating on a QMultiMap ) also occur multiple times in the list.
The order is guaranteed to be the same as that used by values ().
另請參閱 QMultiMap::uniqueKeys (), values ()，和 key ().
這是重載函數。
Returns a list containing all the keys associated with value value in ascending order.
此函數可能很慢 ( 綫性時間 )，因為 QMap 's internal data structure is optimized for fast lookup by key, not by value.
Returns a reference to the last value in the map, that is the value mapped to the largest key. This function assumes that the map is not empty.
When unshared (or const version is called), this executes in logarithmic time .
該函數在 Qt 5.2 引入。
另請參閱 first (), lastKey ()，和 isEmpty ().
這是重載函數。
該函數在 Qt 5.2 引入。
Returns a reference to the largest key in the map. This function assumes that the map is not empty.
This executes in logarithmic time .
該函數在 Qt 5.2 引入。
另請參閱 firstKey (), last (), keyEnd ()，和 isEmpty ().
Returns an iterator pointing to the first item with key key in the map. If the map contains no item with key key , the function returns an iterator to the nearest item with a greater key.
範例：
QMap<int, QString> map; map.insert(1, "one"); map.insert(5, "five"); map.insert(10, "ten"); map.lowerBound(0); // returns iterator to (1, "one") map.lowerBound(1); // returns iterator to (1, "one") map.lowerBound(2); // returns iterator to (5, "five") map.lowerBound(10); // returns iterator to (10, "ten") map.lowerBound(999); // returns end()
If the map contains multiple items with key key , this function returns an iterator that points to the most recently inserted value. The other values are accessible by incrementing the iterator. For example, here's some code that iterates over all the items with the same key:
QMap<QString, int> map; ... QMap<QString, int>::const_iterator i = map.lowerBound("HDR"); QMap<QString, int>::const_iterator upperBound = map.upperBound("HDR"); while (i != upperBound) { cout << i.value() << Qt::endl; ++i; }
另請參閱 upperBound () 和 find ().
這是重載函數。
Removes all the items that have the key key from the map. Returns the number of items removed which will be 1 if the key exists in the map, and 0 otherwise.
另請參閱 clear (), take ()，和 QMultiMap::remove ().
Returns the number of (key, value) pairs in the map.
Swaps map other with this map. This operation is very fast and never fails.
該函數在 Qt 4.8 引入。
Removes the item with the key key from the map and returns the value associated with it.
If the item does not exist in the map, the function simply returns a 默認構造值 . If there are multiple items for key in the map, only the most recently inserted one is removed and returned.
若不使用返迴值， remove () 效率更高。
另請參閱 remove ().
Returns an STL map equivalent to this QMap .
Returns an iterator pointing to the item that immediately follows the last item with key key in the map. If the map contains no item with key key , the function returns an iterator to the nearest item with a greater key.
範例：
QMap<int, QString> map; map.insert(1, "one"); map.insert(5, "five"); map.insert(10, "ten"); map.upperBound(0); // returns iterator to (1, "one") map.upperBound(1); // returns iterator to (5, "five") map.upperBound(2); // returns iterator to (5, "five") map.upperBound(10); // returns end() map.upperBound(999); // returns end()
另請參閱 lowerBound () 和 find ().
這是重載函數。
Returns the value associated with the key key .
If the map contains no item with key key ，函數返迴 defaultValue . If no defaultValue is specified, the function returns a 默認構造值 . If there are multiple items for key in the map, the value of the most recently inserted one is returned.
另請參閱 key (), values (), contains ()，和 operator[] ().
Returns a list containing all the values in the map, in ascending order of their keys. If a key is associated with multiple values, all of its values will be in the list, and not just the most recently inserted one.
返迴
true
if
other
is not equal to this map; otherwise returns
false
.
Two maps are considered equal if they contain the same (key, value) pairs.
This function requires the value type to implement
operator==()
.
另請參閱 operator== ().
返迴
true
if
other
is equal to this map; otherwise returns false.
Two maps are considered equal if they contain the same (key, value) pairs.
This function requires the value type to implement
operator==()
.
另請參閱 operator!= ().
Returns the value associated with the key key 作為可修改引用。
If the map contains no item with key key , the function inserts a 默認構造值 into the map with key key , and returns a reference to it. If the map contains multiple items with key key , this function returns a reference to the most recently inserted value.
這是重載函數。
如同 value ().
寫入映射 map 到流 out .
This function requires the key and value types to implement
operator<<()
.
另請參閱 QDataStream 運算符格式 .
讀取映射從流 in into map .
This function requires the key and value types to implement
operator>>()
.
另請參閱 QDataStream 運算符格式 .
