C++ åèæå
- C++11
- C++14
- C++17
- C++20
- C++ ç¼è¯å¨æ¯ææ åµè¡¨
- ç¬ç«ä¸å®¿ä¸»å®ç°
- C++ è¯è¨
- C++ å ³é®è¯
- é¢å¤çå¨
- C++ æ ååºå¤´æä»¶
- å ·åè¦æ±
- åè½ç¹æ§æµè¯ (C++20)
- å·¥å ·åº
- ç±»åæ¯æï¼åºæ¬ç±»åãRTTIãç±»åç¹æ§ï¼
- æ¦å¿µåº (C++20)
- é误å¤ç
- 卿å å管ç
- æ¥æåæ¶é´å·¥å ·
- å符串åº
- 容å¨åº
- std::array
- std::vector
- std::map
- std::unordered_map
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::operator[]
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::get_allocator
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin, std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cbegin
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::empty
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end, std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cend
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::unordered_map
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::~unordered_map
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::operator=
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::size
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_size
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::clear
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::insert
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::insert_or_assign
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::emplace
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::emplace_hint
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::try_emplace
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::erase
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::swap
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::extract
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::merge
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::at
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::count
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::find
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::contains
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::equal_range
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin(size_type), std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cbegin(size_type)
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end(size_type), std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cend(size_type)
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::bucket_count
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_bucket_count
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::bucket_size
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::bucket
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::load_factor
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_load_factor
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::rehash
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::reserve
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::hash_function
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::key_eq
- operator==,!=(std::unordered_map)
- std::swap(std::unordered_map)
- std::erase_if (std::unordered_map)
- std::unordered_map çæ¨å¯¼æå¼
- std::priority_queue
- std::span
- std::forward_list
- std::deque
- std::list
- std::set
- std::multiset
- std::multimap
- std::unordered_set
- std::unordered_multiset
- std::unordered_multimap
- std::stack
- std::queue
- std::vector<bool>
- ç»ç¹ææ (C++17)
- 注é
- è¿ä»£å¨åº
- èå´åº (C++20)
- ç®æ³åº
- æ°å¼åº
- è¾å ¥/è¾åºåº
- æä»¶ç³»ç»åº
- æ¬å°ååº
- æ£å表达å¼åº
- ååæä½åº
- çº¿ç¨æ¯æåº
- å®éªæ§ C++ ç¹æ§
- æç¨çèµæº
- ç´¢å¼
- std 符å·ç´¢å¼
- åç¨æ¯æ (C++20)
- C++ å ³é®è¯
ä½ç½®ï¼é¦é¡µ > C++ åèæå >容å¨åº >std::unordered_map > std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::unordered_map
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::unordered_map
explicit unordered_map( size_type bucket_count,
            const Hash& hash = Hash(),
            const key_equal& equal = key_equal(),
        const Allocator& alloc )
       : unordered_map(bucket_count, Hash(), key_equal(), alloc) {}
unordered_map( size_type bucket_count,
        const Hash& hash,
        const Allocator& alloc )
unordered_map( InputIt first, InputIt last,
        size_type bucket_count = /*implementation-defined*/,
        const Hash& hash = Hash(),
        const key_equal& equal = key_equal(),
unordered_map( InputIt first, InputIt last,
        size_type bucket_count,
        const Allocator& alloc )
       : unordered_map(first, last,
unordered_map( InputIt first, InputIt last,
        size_type bucket_count,
        const Hash& hash,
        const Allocator& alloc )
       : unordered_map(first, last,
        size_type bucket_count = /*implementation-defined*/,
        const Hash& hash = Hash(),
        const key_equal& equal = key_equal(),
        size_type bucket_count,
        const Allocator& alloc )
       : unordered_map(init, bucket_count,
        size_type bucket_count,
        const Hash& hash,
        const Allocator& alloc )
       : unordered_map(init, bucket_count,
ä»åç§æ°æ®æºæé æ°å®¹å¨ãå¯éçä»¥ç¨æ·æä¾ç bucket_count 为ç¨äºå建çæå°æ¡¶æ°ï¼ä»¥ hash 为åå¸å½æ°ï¼ä»¥ equal 为æ¯è¾å
³é®ç彿°ï¼å以 alloc 为åé
å¨ã
max_load_factor() 为 1.0 ã对äºé»è®¤æé 彿°ï¼æ¡¶æ°æ¯å®ç°å®ä¹çã[first, last) çå
容ç容å¨ã设置 max_load_factor() 为 1.0 ãè¥èå´ä¸çå¤ä¸ªå
ç´ æ¥ææ¯è¾çä»·çå
³é®ï¼åæå
¥åªä¸ªå
ç´ æ¯æªæå®çï¼å¾
å³ç LWG2844 ï¼ãother å
容坿¬ç容å¨ï¼ä¸åå¤å¶å è½½å åãè°è¯ååå¸å½æ°ãè¥ä¸æä¾ alloc ï¼åéè¿è°ç¨ std::allocator_traits<allocator_type>::select_on_container_copy_construction(other.get_allocator()) è·å¾åé
å¨ãother å
容ç容å¨ãè¥ä¸æä¾ alloc ï¼åéè¿ä»å±äº other çåé
å¨ç§»å¨æé è·å¾åé
å¨ãinit å
容ç容å¨ï¼å unordered_map(init.begin(), init.end()) ãåæ°
| alloc | - | ç¨äºæ¤å®¹å¨ææå ååé å¨çåé å¨ |
| bucket_count | - | åå§åæ¶ç¨çæå°æ¡¶æ°ãè¥ä¸æå®ï¼å使ç¨å®ç°å®ä¹çé»è®¤å¼ |
| hash | - | è¦ç¨çåå¸å½æ° |
| equal | - | ç¨äºæ¤å®¹å¨ææå ³é®æ¯è¾çæ¯è¾å½æ° |
| first, last | - | å¤å¶å ç´ æ¥æºçèå´ |
| other | - | ç¨ä½æºä»¥åå§å容å¨å ç´ çå¦ä¸å®¹å¨ |
| init | - | ç¨ä»¥åå§å容å¨å ç´ ç initializer_list |
| ç±»åè¦æ± | ||
-InputIt å¿
须满足éçè¾å
¥è¿ä»£å¨ (LegacyInputIterator) çè¦æ±ã
| ||
å¤æåº¦
first å last é´çè·ç¦»æçº¿æ§ï¼æåæ
嵿平æ¹ãother çå¤§å°æçº¿æ§ãalloc ä¸ alloc != other.get_allocator() å为线æ§ãinit çå¤§å°æçº¿æ§ï¼æåæ
嵿平æ¹ãå¼å¸¸
对 Allocator::allocate çè°ç¨å¯è½æåºã
注æ
other çå¼ç¨åè¿ä»£å¨ï¼é¤äºå°¾è¿ä»£å¨ï¼ä¿æåæ³ï¼ä½æä»£ç°äº *this ä¸çå
ç´ ãå½åæ åç± [container.requirements.general]/12 ä¸çæ»æ¬éè¿°ä½åºæ¤ä¿è¯ï¼è LWG 2321 æ£å¨èèæ´ä¸¥æ ¼çä¿è¯ã
示ä¾
#include <unordered_map> #include <vector> #include <bitset> #include <string> #include <utility>  struct Key { std::string first; std::string second; };  struct KeyHash { std::size_t operator()(const Key& k) const { return std::hash<std::string>()(k.first) ^ (std::hash<std::string>()(k.second) << 1); } };  struct KeyEqual { bool operator()(const Key& lhs, const Key& rhs) const { return lhs.first == rhs.first && lhs.second == rhs.second; } };  struct Foo { Foo(int val_) : val(val_) {} int val; bool operator==(const Foo &rhs) const { return val == rhs.val; } };  namespace std { template<> struct hash<Foo> { std::size_t operator()(const Foo &f) const { return std::hash<int>{}(f.val); } }; }  int main() { // é»è®¤æé 彿°ï¼ç©º unordered_map std::unordered_map<std::string, std::string> m1;  // å表æé 彿° std::unordered_map<int, std::string> m2 = { {1, "foo"}, {3, "bar"}, {2, "baz"}, };  // å¤å¶æé 彿° std::unordered_map<int, std::string> m3 = m2;  // ç§»å¨æé 彿° std::unordered_map<int, std::string> m4 = std::move(m2);  // èå´æé 彿° std::vector<std::pair<std::bitset<8>, int>> v = { {0x12, 1}, {0x01,-1} }; std::unordered_map<std::bitset<8>, double> m5(v.begin(), v.end());  // 带å®å¶ Key ç±»åçæé 彿°çé项 1 // å®ä¹ KeyHash ä¸ KeyEqual ç»æä½å¹¶å¨æ¨¡æ¿ä¸ä½¿ç¨å®ä»¬ std::unordered_map<Key, std::string, KeyHash, KeyEqual> m6 = { { {"John", "Doe"}, "example"}, { {"Mary", "Sue"}, "another"} };  // 带å®å¶ Key ç±»åçæé 彿°çé项 2 // 为 class/struct å®ä¹ const == è¿ç®ç¬¦å¹¶äº std å½å空é´ç¹å std::hash ç»æä½ std::unordered_map<Foo, std::string> m7 = { { Foo(1), "One"}, { 2, "Two"}, { 3, "Three"} };  // é项 3 ï¼ç¨ lambdas // 注æå¿ é¡»å°åå§æ¡¶æ°ä¼ éç»æé 彿° struct Goo {int val; }; auto hash = [](const Goo &g){ return std::hash<int>{}(g.val); }; auto comp = [](const Goo &l, const Goo &r){ return l.val == r.val; }; std::unordered_map<Goo, double, decltype(hash), decltype(comp)> m8(10, hash, comp); }
ç¼ºé·æ¥å
ä¸åæ´æ¹è¡ä¸ºçç¼ºé·æ¥å追溯å°åºç¨äºä»¥ååºçç C++ æ åã
| DR | åºç¨äº | åºçæ¶çè¡ä¸º | æ£ç¡®è¡ä¸º |
|---|---|---|---|
| LWG 2193 | C++11 | é»è®¤æé 彿°ä¸º explicit | 使ä¹ä¸ºé explicit |
åé
| èµå¼ç»å®¹å¨ (å ¬å¼æå彿°) |