Home
last modified time | relevance | path

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

/third_party/skia/third_party/externals/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
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
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DPriorityWorklist.h194 bool erase_if(UnaryPredicate P) { in erase_if() function
/third_party/mesa3d/src/gallium/frontends/clover/util/
Dalgorithm.hpp204 erase_if(F &&f, R &&r) { in erase_if() function