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::map<Key,T,Compare,Allocator>::emplace
- std::map<Key,T,Compare,Allocator>::get_allocator
- std::map<Key,T,Compare,Allocator>::at
- std::map<Key,T,Compare,Allocator>::operator[]
- std::map<Key,T,Compare,Allocator>::begin, std::map<Key,T,Compare,Allocator>::cbegin
- std::map<Key,T,Compare,Allocator>::end, std::map<Key,T,Compare,Allocator>::cend
- std::map<Key,T,Compare,Allocator>::extract
- std::map<Key,T,Compare,Allocator>::merge
- std::map<Key,T,Compare,Allocator>::try_emplace
- std::map<Key,T,Compare,Allocator>::insert_or_assign
- std::map<Key,T,Compare,Allocator>::clear
- std::map<Key,T,Compare,Allocator>::map
- std::map<Key,T,Compare,Allocator>::~map
- std::map<Key,T,Compare,Allocator>::operator=
- std::map<Key,T,Compare,Allocator>::rbegin, std::map<Key,T,Compare,Allocator>::crbegin
- std::map<Key,T,Compare,Allocator>::rend, std::map<Key,T,Compare,Allocator>::crend
- std::map<Key,T,Compare,Allocator>::empty
- std::map<Key,T,Compare,Allocator>::size
- std::map<Key,T,Compare,Allocator>::max_size
- std::map<Key,T,Compare,Allocator>::insert
- std::map<Key,T,Compare,Allocator>::emplace_hint
- std::map<Key,T,Compare,Allocator>::erase
- std::map<Key,T,Compare,Allocator>::swap
- std::map<Key,T,Compare,Allocator>::count
- std::map<Key,T,Compare,Allocator>::find
- std::map<Key,T,Compare,Allocator>::contains
- std::map<Key,T,Compare,Allocator>::equal_range
- std::map<Key,T,Compare,Allocator>::lower_bound
- std::map<Key,T,Compare,Allocator>::upper_bound
- std::map<Key,T,Compare,Allocator>::key_comp
- std::map<Key,T,Compare,Allocator>::value_comp
- std::swap(std::map)
- std::erase_if (std::map)
- operator==,!=,<,<=,>,>=,<=>(std::map)
- std::map çæ¨å¯¼æå¼
- std::map<Key,T,Compare,Allocator>::value_compare
- 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::map > std::map<Key,T,Compare,Allocator>::erase
std::map<Key,T,Compare,Allocator>::erase
| (1) | ||
| void erase( iterator pos ); |
(C++11 å) | |
| iterator erase( const_iterator pos ); |
(C++11 èµ·) | |
| iterator erase( iterator pos ); |
(C++17 èµ·) | |
| (2) | ||
| void erase( iterator first, iterator last ); |
(C++11 å) | |
| iterator erase( const_iterator first, const_iterator last ); |
(C++11 èµ·) | |
| size_type erase( const key_type& key ); |
(3) | |
ä»å®¹å¨ç§»é¤æå®çå ç´ ã
1) ç§»é¤ä½äº
pos çå
ç´ ã2) ç§»é¤èå´
[first; last) ä¸çå
ç´ ï¼å®å¿
é¡»æ¯ *this ä¸çåæ³èå´ã3) ç§»é¤å
³é®çäº
key çå
ç´ ï¼è¥åå¨ä¸ä¸ªï¼ãæå被æ¦é¤å ç´ çå¼ç¨åè¿ä»£å¨è¢«éæ³åãå ¶ä»å¼ç¨åè¿ä»£å¨ä¸åå½±åã
è¿ä»£å¨ pos å¿
须忳ä¸å¯è§£å¼ç¨ãä»è end() è¿ä»£å¨ï¼åæ³ï¼ä½ä¸å¯è§£å¼ç¨ï¼ä¸è½ç¨ä½ pos æç¨çå¼ã
åæ°
| pos | - | æåè¦ç§»é¤çå ç´ çè¿ä»£å¨ |
| first, last | - | è¦ç§»é¤çå ç´ èå´ |
| key | - | è¦ç§»é¤çå ç´ å ³é®å¼ |
è¿åå¼
1-2) åéæå被移é¤çå
ç´ çè¿ä»£å¨ã
3) 被移é¤çå
ç´ æ°ã
å¼å¸¸
1,2) ï¼æ ï¼
3) ä»»ä½
Compare 对象ææçå¼å¸¸å¤æåº¦
ç»å® map çå®ä¾ c ï¼
1) åæå¸¸æ°
2) log(c.size()) + std::distance(first, last)
3) log(c.size()) + c.count(k)
示ä¾
è¿è¡æ¤ä»£ç
#include <map> #include <iostream> int main() { std::map<int, std::string> c = {{1, "one"}, {2, "two"}, {3, "three"}, {4, "four"}, {5, "five"}, {6, "six"}}; // ä» c æ¦é¤ææå¥æ° for(auto it = c.begin(); it != c.end(); ) if(it->first % 2 == 1) it = c.erase(it); else ++it; for(auto& p : c) std::cout << p.second << ' '; }
è¾åºï¼
two four six
åé
| æ¸
é¤å
容 (å ¬å¼æå彿°) |