Home
last modified time | relevance | path

Searched defs:erase_if (Results 1 – 25 of 46) sorted by relevance

12

/external/openscreen/third_party/abseil/src/absl/container/
Dbtree_set.h367 void erase_if(btree_set<K, C, A> &set, Pred pred) { in erase_if() function
670 void erase_if(btree_multiset<K, C, A> &set, Pred pred) { in erase_if() function
Dbtree_map.h448 void erase_if(btree_map<K, V, C, A> &map, Pred pred) { in erase_if() function
756 void erase_if(btree_multimap<K, V, C, A> &map, Pred pred) { in erase_if() function
Dnode_hash_set.h437 void erase_if(node_hash_set<T, H, E, A>& c, Predicate pred) { in erase_if() function
Dflat_hash_set.h447 void erase_if(flat_hash_set<T, H, E, A>& c, Predicate pred) { in erase_if() function
Dnode_hash_map.h530 void erase_if(node_hash_map<K, V, H, E, A>& c, Predicate pred) { in erase_if() function
Dflat_hash_map.h546 void erase_if(flat_hash_map<K, V, H, E, A>& c, Predicate pred) { in erase_if() function
/external/angle/third_party/abseil-cpp/absl/container/
Dbtree_map.h507 typename btree_map<K, V, C, A>::size_type erase_if( in erase_if() function
849 typename btree_multimap<K, V, C, A>::size_type erase_if( in erase_if() function
Dbtree_set.h427 typename btree_set<K, C, A>::size_type erase_if(btree_set<K, C, A> &set, in erase_if() function
764 typename btree_multiset<K, C, A>::size_type erase_if( in erase_if() function
/external/cronet/stable/third_party/abseil-cpp/absl/container/
Dbtree_map.h505 typename btree_map<K, V, C, A>::size_type erase_if( in erase_if() function
847 typename btree_multimap<K, V, C, A>::size_type erase_if( in erase_if() function
Dbtree_set.h425 typename btree_set<K, C, A>::size_type erase_if(btree_set<K, C, A> &set, in erase_if() function
762 typename btree_multiset<K, C, A>::size_type erase_if( in erase_if() function
/external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/
Dbtree_map.h502 typename btree_map<K, V, C, A>::size_type erase_if( in erase_if() function
844 typename btree_multimap<K, V, C, A>::size_type erase_if( in erase_if() function
Dbtree_set.h422 typename btree_set<K, C, A>::size_type erase_if(btree_set<K, C, A> &set, in erase_if() function
759 typename btree_multiset<K, C, A>::size_type erase_if( in erase_if() function
Dnode_hash_set.h443 typename node_hash_set<T, H, E, A>::size_type erase_if( in erase_if() function
Dflat_hash_set.h452 typename flat_hash_set<T, H, E, A>::size_type erase_if( in erase_if() function
Dnode_hash_map.h536 typename node_hash_map<K, V, H, E, A>::size_type erase_if( in erase_if() function
Dflat_hash_map.h552 typename flat_hash_map<K, V, H, E, A>::size_type erase_if( in erase_if() function
/external/abseil-cpp/absl/container/
Dbtree_map.h505 typename btree_map<K, V, C, A>::size_type erase_if( in erase_if() function
847 typename btree_multimap<K, V, C, A>::size_type erase_if( in erase_if() function
Dbtree_set.h425 typename btree_set<K, C, A>::size_type erase_if(btree_set<K, C, A> &set, in erase_if() function
762 typename btree_multiset<K, C, A>::size_type erase_if( in erase_if() function
/external/cronet/tot/third_party/abseil-cpp/absl/container/
Dbtree_map.h505 typename btree_map<K, V, C, A>::size_type erase_if( in erase_if() function
847 typename btree_multimap<K, V, C, A>::size_type erase_if( in erase_if() function
Dbtree_set.h425 typename btree_set<K, C, A>::size_type erase_if(btree_set<K, C, A> &set, in erase_if() function
762 typename btree_multiset<K, C, A>::size_type erase_if( in erase_if() function
/external/cronet/stable/third_party/libc++/src/include/__vector/
Derase.h38 erase_if(vector<_Tp, _Allocator>& __c, _Predicate __pred) { in erase_if() function
/external/cronet/tot/third_party/libc++/src/include/__vector/
Derase.h38 erase_if(vector<_Tp, _Allocator>& __c, _Predicate __pred) { in erase_if() function
/external/llvm/include/llvm/ADT/
DPriorityWorklist.h158 bool erase_if(UnaryPredicate P) { in erase_if() function
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DPriorityWorklist.h194 bool erase_if(UnaryPredicate P) { in erase_if() function
/external/swiftshader/third_party/llvm-16.0/llvm/include/llvm/ADT/
DPriorityWorklist.h193 bool erase_if(UnaryPredicate P) { in erase_if() function

12