| /third_party/gn/src/base/ |
| D | stl_util.h | 149 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(std::multiset<Key, Compare, Allocator>& container, in EraseIf() function
233 void EraseIf(std::unordered_map<Key, T, Hash, KeyEqual, Allocator>& container, in EraseIf() function
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/container/ |
| D | node_hash_set_test.cc | 107 TEST(NodeHashSet, EraseIf) { in TEST() argument
|
| D | flat_hash_set.h | 448 container_internal::EraseIf(pred, &c); in erase_if()
|
| D | node_hash_set.h | 438 container_internal::EraseIf(pred, &c); in erase_if()
|
| D | flat_hash_set_test.cc | 142 TEST(FlatHashSet, EraseIf) { in TEST() argument
|
| D | node_hash_map.h | 531 container_internal::EraseIf(pred, &c); in erase_if()
|
| D | flat_hash_map.h | 547 container_internal::EraseIf(pred, &c); in erase_if()
|
| D | node_hash_map_test.cc | 222 TEST(NodeHashMap, EraseIf) { in TEST() argument
|
| D | flat_hash_map_test.cc | 235 TEST(FlatHashMap, EraseIf) { in TEST() argument
|
| D | btree_test.cc | 2451 TEST(Btree, EraseIf) { in TEST() argument
|
| /third_party/node/deps/v8/src/torque/ |
| D | utils.h | 330 void EraseIf(Container* container, F f) { in EraseIf() function
|
| D | types.h | 457 EraseIf(&types_, in Extend()
|
| /third_party/gn/src/base/containers/ |
| D | circular_deque.h | 1103 void EraseIf(circular_deque<T>& container, Predicate pred) { in EraseIf() function
|
| D | flat_tree.h | 995 void EraseIf(base::internal::flat_tree<Key, Value, GetKeyFromValue, KeyCompare>&
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/ |
| D | raw_hash_set.h | 1924 void EraseIf(Predicate& pred, raw_hash_set<P, H, E, A>* c) {
|