Home
last modified time | relevance | path

Searched defs:erase_if (Results 1 – 25 of 40) 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
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/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
/external/angle/third_party/abseil-cpp/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.h447 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
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
/external/abseil-cpp/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.h443 void erase_if(btree_map<K, V, C, A> &map, Pred pred) { in erase_if() function
746 void erase_if(btree_multimap<K, V, C, A> &map, Pred pred) { in erase_if() function
Dnode_hash_set.h442 void erase_if(node_hash_set<T, H, E, A>& c, Predicate pred) { in erase_if() function
Dflat_hash_set.h446 void erase_if(flat_hash_set<T, H, E, A>& c, Predicate pred) { in erase_if() function
/external/libtextclassifier/abseil-cpp/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
/external/webrtc/third_party/abseil-cpp/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.h443 void erase_if(btree_map<K, V, C, A> &map, Pred pred) { in erase_if() function
746 void erase_if(btree_multimap<K, V, C, A> &map, Pred pred) { in erase_if() function
Dflat_hash_set.h446 void erase_if(flat_hash_set<T, H, E, A>& c, Predicate pred) { in erase_if() function
Dnode_hash_set.h442 void erase_if(node_hash_set<T, H, E, A>& c, Predicate pred) { in erase_if() function

12