32 void IterateAndEraseIf(Container& container, Predicate pred) {  in IterateAndEraseIf()  argument
33   for (auto it = container.begin(); it != container.end();) {  in IterateAndEraseIf()
35       it = container.erase(it);  in IterateAndEraseIf()
142 void Erase(std::basic_string<CharT, Traits, Allocator>& container,  in Erase()  argument
144   container.erase(std::remove(container.begin(), container.end(), value),  in Erase()
145                   container.end());  in Erase()
149 void EraseIf(std::basic_string<CharT, Traits, Allocator>& container,  in EraseIf()  argument
151   container.erase(std::remove_if(container.begin(), container.end(), pred),  in EraseIf()
152                   container.end());  in EraseIf()
156 void Erase(std::deque<T, Allocator>& container, const Value& value) {  in Erase()  argument
157   container.erase(std::remove(container.begin(), container.end(), value),  in Erase()
158                   container.end());  in Erase()
162 void EraseIf(std::deque<T, Allocator>& container, Predicate pred) {  in EraseIf()  argument
163   container.erase(std::remove_if(container.begin(), container.end(), pred),  in EraseIf()
164                   container.end());  in EraseIf()
168 void Erase(std::vector<T, Allocator>& container, const Value& value) {  in Erase()  argument
169   container.erase(std::remove(container.begin(), container.end(), value),  in Erase()
170                   container.end());  in Erase()
174 void EraseIf(std::vector<T, Allocator>& container, Predicate pred) {  in EraseIf()  argument
175   container.erase(std::remove_if(container.begin(), container.end(), pred),  in EraseIf()
176                   container.end());  in EraseIf()
180 void Erase(std::forward_list<T, Allocator>& container, const Value& value) {  in Erase()  argument
184   container.remove_if([&](const T& cur) { return cur == value; });  in Erase()
188 void EraseIf(std::forward_list<T, Allocator>& container, Predicate pred) {  in EraseIf()  argument
189   container.remove_if(pred);  in EraseIf()
193 void Erase(std::list<T, Allocator>& container, const Value& value) {  in Erase()  argument
197   container.remove_if([&](const T& cur) { return cur == value; });  in Erase()
201 void EraseIf(std::list<T, Allocator>& container, Predicate pred) {  in EraseIf()  argument
202   container.remove_if(pred);  in EraseIf()
206 void EraseIf(std::map<Key, T, Compare, Allocator>& container, Predicate pred) {  in EraseIf()  argument
207   internal::IterateAndEraseIf(container, pred);  in EraseIf()
211 void EraseIf(std::multimap<Key, T, Compare, Allocator>& container,  in EraseIf()  argument
213   internal::IterateAndEraseIf(container, pred);  in EraseIf()
217 void EraseIf(std::set<Key, Compare, Allocator>& container, Predicate pred) {  in EraseIf()  argument
218   internal::IterateAndEraseIf(container, pred);  in EraseIf()
222 void EraseIf(std::multiset<Key, Compare, Allocator>& container,  in EraseIf()  argument
224   internal::IterateAndEraseIf(container, pred);  in EraseIf()
233 void EraseIf(std::unordered_map<Key, T, Hash, KeyEqual, Allocator>& container,  in EraseIf()  argument
235   internal::IterateAndEraseIf(container, pred);  in EraseIf()
245     std::unordered_multimap<Key, T, Hash, KeyEqual, Allocator>& container,  in EraseIf()  argument
247   internal::IterateAndEraseIf(container, pred);  in EraseIf()
255 void EraseIf(std::unordered_set<Key, Hash, KeyEqual, Allocator>& container,  in EraseIf()  argument
257   internal::IterateAndEraseIf(container, pred);  in EraseIf()
265 void EraseIf(std::unordered_multiset<Key, Hash, KeyEqual, Allocator>& container,  in EraseIf()  argument
267   internal::IterateAndEraseIf(container, pred);  in EraseIf()