| /external/libtextclassifier/abseil-cpp/absl/container/ |
| D | btree_set.h | 367 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
|
| D | btree_map.h | 448 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
|
| D | node_hash_set.h | 437 void erase_if(node_hash_set<T, H, E, A>& c, Predicate pred) { in erase_if() function
|
| /external/openscreen/third_party/abseil/src/absl/container/ |
| D | btree_set.h | 367 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
|
| D | btree_map.h | 448 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
|
| D | node_hash_set.h | 437 void erase_if(node_hash_set<T, H, E, A>& c, Predicate pred) { in erase_if() function
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/ |
| D | btree_set.h | 367 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
|
| D | btree_map.h | 447 void erase_if(btree_map<K, V, C, A> &map, Pred pred) { in erase_if() function
755 void erase_if(btree_multimap<K, V, C, A> &map, Pred pred) { in erase_if() function
|
| D | node_hash_set.h | 437 void erase_if(node_hash_set<T, H, E, A>& c, Predicate pred) { in erase_if() function
|
| /external/tensorflow/third_party/absl/abseil-cpp/absl/container/ |
| D | btree_map.h | 483 typename btree_map<K, V, C, A>::size_type erase_if( in erase_if() function
810 typename btree_multimap<K, V, C, A>::size_type erase_if( in erase_if() function
|
| D | btree_set.h | 403 typename btree_set<K, C, A>::size_type erase_if(btree_set<K, C, A> &set, in erase_if() function
725 typename btree_multiset<K, C, A>::size_type erase_if( in erase_if() function
|
| D | node_hash_set.h | 443 typename node_hash_set<T, H, E, A>::size_type erase_if( in erase_if() function
|
| /external/angle/third_party/abseil-cpp/absl/container/ |
| D | btree_map.h | 502 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
|
| D | btree_set.h | 422 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
|
| D | node_hash_set.h | 447 typename node_hash_set<T, H, E, A>::size_type erase_if( in erase_if() function
|
| /external/webrtc/third_party/abseil-cpp/absl/container/ |
| D | btree_map.h | 487 typename btree_map<K, V, C, A>::size_type erase_if( in erase_if() function
814 typename btree_multimap<K, V, C, A>::size_type erase_if( in erase_if() function
|
| D | btree_set.h | 407 typename btree_set<K, C, A>::size_type erase_if(btree_set<K, C, A> &set, in erase_if() function
729 typename btree_multiset<K, C, A>::size_type erase_if( in erase_if() function
|
| D | node_hash_set.h | 443 typename node_hash_set<T, H, E, A>::size_type erase_if( in erase_if() function
|
| D | flat_hash_set.h | 452 typename flat_hash_set<T, H, E, A>::size_type erase_if( in erase_if() function
|
| /external/cronet/third_party/abseil-cpp/absl/container/ |
| D | btree_map.h | 502 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
|
| D | btree_set.h | 422 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
|
| D | node_hash_set.h | 443 typename node_hash_set<T, H, E, A>::size_type erase_if( in erase_if() function
|
| /external/abseil-cpp/absl/container/ |
| D | btree_map.h | 483 typename btree_map<K, V, C, A>::size_type erase_if( in erase_if() function
810 typename btree_multimap<K, V, C, A>::size_type erase_if( in erase_if() function
|
| D | btree_set.h | 403 typename btree_set<K, C, A>::size_type erase_if(btree_set<K, C, A> &set, in erase_if() function
725 typename btree_multiset<K, C, A>::size_type erase_if( in erase_if() function
|
| D | node_hash_set.h | 443 typename node_hash_set<T, H, E, A>::size_type erase_if( in erase_if() function
|