Home
last modified time | relevance | path

Searched defs:EraseIf (Results 1 - 4 of 4) sorted by relevance

/third_party/gn/src/base/
H A Dstl_util.h149 void EraseIf(std::basic_string<CharT, Traits, Allocator>& container, in EraseIf() function
162 void EraseIf(std::deque<T, Allocator>& container, Predicate pred) { in EraseIf() function
174 void EraseIf(std::vector<T, Allocator>& container, Predicate pred) { in EraseIf() function
188 void EraseIf(std::forward_list<T, Allocator>& container, Predicate pred) { in EraseIf() function
201 void EraseIf(std::list<T, Allocator>& container, Predicate pred) { in EraseIf() function
206 void EraseIf(std::map<Key, T, Compare, Allocator>& container, Predicate pred) { in EraseIf() function
211 void EraseIf(std::multimap<Key, T, Compare, Allocator>& container, in EraseIf() function
217 void EraseIf(std::set<Key, Compare, Allocator>& container, Predicate pred) { in EraseIf() function
222 void EraseIf(st function
233 void EraseIf(std::unordered_map<Key, T, Hash, KeyEqual, Allocator>& container, EraseIf() function
244 void EraseIf( EraseIf() function
255 void EraseIf(std::unordered_set<Key, Hash, KeyEqual, Allocator>& container, EraseIf() function
265 void EraseIf(std::unordered_multiset<Key, Hash, KeyEqual, Allocator>& container, EraseIf() function
[all...]
/third_party/gn/src/base/containers/
H A Dflat_tree.h995 void EraseIf(base::internal::flat_tree<Key, Value, GetKeyFromValue, KeyCompare>& in EraseIf() function
H A Dcircular_deque.h1103 void EraseIf(circular_deque<T>& container, Predicate pred) { in EraseIf() function
/third_party/node/deps/v8/src/torque/
H A Dutils.h330 void EraseIf(Container* container, F f) { in EraseIf() function

Completed in 6 milliseconds