std::experimental::erase_if (std::unordered_multimap)
来自 cppreference.com
< cpp | experimental
| 定义在头文件 <experimental/unordered_map> 中 |
||
| template< class Key, class T, class Hash, class KeyEqual, class Alloc, class Pred > void erase_if( std::unordered_multimap<Key, T, Hash, KeyEqual, Alloc>& c, Pred pred ); |
(库基础 TS v2) | |
从容器中擦除所有满足谓词 pred 的元素。等效于
for (auto i = c.begin(), last = c.end(); i != last;) { if (pred(*i)) i = c.erase(i); else ++i; }
内容 |
[编辑] 参数
| c | - | 要从其中擦除的容器 |
| pred | - | 确定要擦除哪些元素的谓词 |
[编辑] 复杂度
线性。
[编辑] 示例
运行此代码
#include <experimental/unordered_map> #include <iostream> template<typename Os, typename Container> inline Os& operator<<(Os& os, Container const& cont) { os << '{'; for (const auto& item : cont) os << '{' << item.first << ", " << item.second << '}'; return os << '}'; } int main() { std::unordered_multimap<int, char> data{{1, 'a'},{2, 'b'},{3, 'c'},{4, 'd'}, {5, 'e'},{4, 'f'},{5, 'g'},{5, 'g'}}; std::cout << "Original:\n" << data << '\n'; std::experimental::erase_if(data, [](const auto& item) { return (item.first & 1) == 1; }); std::cout << "Erase items with odd keys:\n" << data << '\n'; }
可能的输出
Original:
{{5, g}{5, g}{5, e}{4, f}{4, d}{3, c}{2, b}{1, a}}
Erase items with odd keys:
{{4, f}{4, d}{2, b}}[编辑] 参见
| 删除满足特定条件的元素 (函数模板) |
