Home
last modified time | relevance | path

Searched refs:erase_if (Results 1 - 25 of 25) sorted by relevance

/third_party/skia/third_party/externals/abseil-cpp/absl/container/
H A Dflat_hash_set_test.cc146 erase_if(s, [](int) { return true; }); in TEST()
152 erase_if(s, [](int) { return false; }); in TEST()
158 erase_if(s, [](int k) { return k % 2 == 1; }); in TEST()
164 erase_if(s, IsEven); in TEST()
170 erase_if(s, &IsEven); in TEST()
H A Dnode_hash_set_test.cc111 erase_if(s, [](int) { return true; }); in TEST()
117 erase_if(s, [](int) { return false; }); in TEST()
123 erase_if(s, [](int k) { return k % 2 == 1; }); in TEST()
129 erase_if(s, IsEven); in TEST()
135 erase_if(s, &IsEven); in TEST()
H A Dflat_hash_map_test.cc239 erase_if(s, [](std::pair<const int, int>) { return true; }); in TEST()
245 erase_if(s, [](std::pair<const int, int>) { return false; }); in TEST()
252 erase_if(s, in TEST()
259 erase_if(s, FirstIsEven); in TEST()
265 erase_if(s, &FirstIsEven); in TEST()
H A Dnode_hash_map_test.cc226 erase_if(s, [](std::pair<const int, int>) { return true; }); in TEST()
232 erase_if(s, [](std::pair<const int, int>) { return false; }); in TEST()
239 erase_if(s, in TEST()
246 erase_if(s, FirstIsEven); in TEST()
252 erase_if(s, &FirstIsEven); in TEST()
H A Dbtree_set.h363 // absl::erase_if(absl::btree_set<>, Pred)
367 void erase_if(btree_set<K, C, A> &set, Pred pred) { in erase_if() function
666 // absl::erase_if(absl::btree_multiset<>, Pred)
670 void erase_if(btree_multiset<K, C, A> &set, Pred pred) { in erase_if() function
H A Dbtree_map.h443 // absl::erase_if(absl::btree_map<>, Pred)
447 void erase_if(btree_map<K, V, C, A> &map, Pred pred) { in erase_if() function
751 // absl::erase_if(absl::btree_multimap<>, Pred)
755 void erase_if(btree_multimap<K, V, C, A> &map, Pred pred) { in erase_if() function
H A Dflat_hash_set.h443 // erase_if(flat_hash_set<>, Pred)
447 void erase_if(flat_hash_set<T, H, E, A>& c, Predicate pred) { in erase_if() function
H A Dnode_hash_set.h433 // erase_if(node_hash_set<>, Pred)
437 void erase_if(node_hash_set<T, H, E, A>& c, Predicate pred) { in erase_if() function
H A Dflat_hash_map.h541 // erase_if(flat_hash_map<>, Pred)
546 void erase_if(flat_hash_map<K, V, H, E, A>& c, Predicate pred) { in erase_if() function
H A Dnode_hash_map.h525 // erase_if(node_hash_map<>, Pred)
530 void erase_if(node_hash_map<K, V, H, E, A>& c, Predicate pred) { in erase_if() function
H A Dbtree_test.cc2452 // Test that erase_if works with all the container types and supports lambdas. in TEST()
2455 erase_if(s, [](int k) { return k > 3; }); in TEST()
2460 erase_if(s, [](int k) { return k <= 3; }); in TEST()
2465 erase_if(m, [](std::pair<const int, int> kv) { return kv.first > 3; }); in TEST()
2471 erase_if(m, [](std::pair<const int, int> kv) { return kv.second == 6; }); in TEST()
2479 erase_if(s, IsEven); in TEST()
2482 // Test that erase_if supports other format of function pointers. in TEST()
2485 erase_if(s, &IsEven); in TEST()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/
H A DAlwaysInliner.cpp72 erase_if(InlinedFunctions, [&](Function *F) { in run()
H A DFunctionAttrs.cpp1164 llvm::erase_if(InferInSCC, [F](const InferenceDescriptor &ID) {
1186 llvm::erase_if(InferInThisFunc, [&](const InferenceDescriptor &ID) {
1191 llvm::erase_if(InferInSCC, [&ID](const InferenceDescriptor &D) {
/third_party/mesa3d/src/gallium/frontends/clover/util/
H A Dalgorithm.hpp204 erase_if(F &&f, R &&r) { in erase_if() function
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DPriorityWorklist.h194 bool erase_if(UnaryPredicate P) { in erase_if() function in llvm::PriorityWorklist
H A DSTLExtras.h1333 /// `erase_if` which is equivalent to:
1340 void erase_if(Container &C, UnaryPredicate P) { in erase_if() function
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
H A DSimpleLoopUnswitch.cpp310 llvm::erase_if(OldContainingL->getBlocksVector(), in hoistLoopToNewParent()
1526 llvm::erase_if(ExitBlocks, in deleteDeadBlocksFromLoop()
1533 llvm::erase_if(ParentL->getBlocksVector(), in deleteDeadBlocksFromLoop()
1539 llvm::erase_if(L.getSubLoopsVector(), [&](Loop *ChildL) { in deleteDeadBlocksFromLoop()
1725 llvm::erase_if(IL->getBlocksVector(), [&](BasicBlock *BB) { in rebuildLoopAfterUnswitch()
1771 llvm::erase_if(L.getBlocksVector(), [&](BasicBlock *BB) { in rebuildLoopAfterUnswitch()
H A DLoopUnrollPass.cpp1362 erase_if(SibLoops, [&](Loop *SibLoop) { in run()
H A DJumpThreading.cpp1687 erase_if(PredToDestList, in ProcessThreadableEdges()
/third_party/mesa3d/src/gallium/frontends/clover/core/
H A Dresource.cpp92 erase_if([&](const mapping &b) { in del_map()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
H A DModuleUtils.cpp247 erase_if(DeadComdatFunctions, [&](GlobalValue *GV) { in filterDeadComdatFunctions()
/third_party/mesa3d/src/gallium/frontends/clover/llvm/
H A Dinvocation.cpp477 erase_if(equals("-create-library"), options); in link_program()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DMachineOutliner.cpp1212 erase_if(OF.Candidates, [&Mapper](Candidate &C) { in outline()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/X86/
H A DX86SpeculativeLoadHardening.cpp2004 llvm::erase_if(HardenOpRegs, [&](MachineOperand *Op) { in hardenLoadAddr()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp6548 erase_if(VPlans, [VF](const VPlanPtr &Plan) {

Completed in 45 milliseconds