Home
last modified time | relevance | path

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

12345678910>>...14

/external/openscreen/third_party/abseil/src/absl/container/
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()
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()
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()
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()
/external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/
Dnode_hash_set_test.cc111 EXPECT_EQ(erase_if(s, [](int) { return true; }), 5); in TEST()
117 EXPECT_EQ(erase_if(s, [](int) { return false; }), 0); in TEST()
123 EXPECT_EQ(erase_if(s, [](int k) { return k % 2 == 1; }), 3); in TEST()
129 EXPECT_EQ(erase_if(s, IsEven), 2); in TEST()
135 EXPECT_EQ(erase_if(s, &IsEven), 2); in TEST()
Dflat_hash_set_test.cc146 EXPECT_EQ(erase_if(s, [](int) { return true; }), 5); in TEST()
152 EXPECT_EQ(erase_if(s, [](int) { return false; }), 0); in TEST()
158 EXPECT_EQ(erase_if(s, [](int k) { return k % 2 == 1; }), 3); in TEST()
164 EXPECT_EQ(erase_if(s, IsEven), 2); in TEST()
170 EXPECT_EQ(erase_if(s, &IsEven), 2); in TEST()
Dflat_hash_map_test.cc239 EXPECT_EQ(erase_if(s, [](std::pair<const int, int>) { return true; }), 5); in TEST()
245 EXPECT_EQ(erase_if(s, [](std::pair<const int, int>) { return false; }), 0); in TEST()
252 EXPECT_EQ(erase_if(s, in TEST()
262 EXPECT_EQ(erase_if(s, FirstIsEven), 2); in TEST()
268 EXPECT_EQ(erase_if(s, &FirstIsEven), 2); in TEST()
Dnode_hash_map_test.cc226 EXPECT_EQ(erase_if(s, [](std::pair<const int, int>) { return true; }), 5); in TEST()
232 EXPECT_EQ(erase_if(s, [](std::pair<const int, int>) { return false; }), 0); in TEST()
239 EXPECT_EQ(erase_if(s, in TEST()
249 EXPECT_EQ(erase_if(s, FirstIsEven), 2); in TEST()
255 EXPECT_EQ(erase_if(s, &FirstIsEven), 2); in TEST()
/external/cronet/stable/third_party/abseil-cpp/absl/container/
Dnode_hash_set_test.cc124 EXPECT_EQ(erase_if(s, [](int) { return true; }), 5); in TEST()
130 EXPECT_EQ(erase_if(s, [](int) { return false; }), 0); in TEST()
136 EXPECT_EQ(erase_if(s, [](int k) { return k % 2 == 1; }), 3); in TEST()
142 EXPECT_EQ(erase_if(s, IsEven), 2); in TEST()
148 EXPECT_EQ(erase_if(s, &IsEven), 2); in TEST()
Dbtree_set.h425 typename btree_set<K, C, A>::size_type erase_if(btree_set<K, C, A> &set, in erase_if() function
427 return container_internal::btree_access::erase_if(set, std::move(pred)); in erase_if()
762 typename btree_multiset<K, C, A>::size_type erase_if( in erase_if() function
764 return container_internal::btree_access::erase_if(set, std::move(pred)); in erase_if()
/external/angle/third_party/abseil-cpp/absl/container/
Dnode_hash_set_test.cc124 EXPECT_EQ(erase_if(s, [](int) { return true; }), 5); in TEST()
130 EXPECT_EQ(erase_if(s, [](int) { return false; }), 0); in TEST()
136 EXPECT_EQ(erase_if(s, [](int k) { return k % 2 == 1; }), 3); in TEST()
142 EXPECT_EQ(erase_if(s, IsEven), 2); in TEST()
148 EXPECT_EQ(erase_if(s, &IsEven), 2); in TEST()
Dbtree_map.h507 typename btree_map<K, V, C, A>::size_type erase_if( in erase_if() function
509 return container_internal::btree_access::erase_if(map, std::move(pred)); in erase_if()
849 typename btree_multimap<K, V, C, A>::size_type erase_if( in erase_if() function
851 return container_internal::btree_access::erase_if(map, std::move(pred)); in erase_if()
/external/abseil-cpp/absl/container/
Dnode_hash_set_test.cc124 EXPECT_EQ(erase_if(s, [](int) { return true; }), 5); in TEST()
130 EXPECT_EQ(erase_if(s, [](int) { return false; }), 0); in TEST()
136 EXPECT_EQ(erase_if(s, [](int k) { return k % 2 == 1; }), 3); in TEST()
142 EXPECT_EQ(erase_if(s, IsEven), 2); in TEST()
148 EXPECT_EQ(erase_if(s, &IsEven), 2); in TEST()
Dflat_hash_set_test.cc155 EXPECT_EQ(erase_if(s, [](int) { return true; }), 5); in TEST()
161 EXPECT_EQ(erase_if(s, [](int) { return false; }), 0); in TEST()
167 EXPECT_EQ(erase_if(s, [](int k) { return k % 2 == 1; }), 3); in TEST()
173 EXPECT_EQ(erase_if(s, IsEven), 2); in TEST()
179 EXPECT_EQ(erase_if(s, &IsEven), 2); in TEST()
Dbtree_set.h425 typename btree_set<K, C, A>::size_type erase_if(btree_set<K, C, A> &set, in erase_if() function
427 return container_internal::btree_access::erase_if(set, std::move(pred)); in erase_if()
762 typename btree_multiset<K, C, A>::size_type erase_if( in erase_if() function
764 return container_internal::btree_access::erase_if(set, std::move(pred)); in erase_if()
/external/cronet/tot/third_party/abseil-cpp/absl/container/
Dnode_hash_set_test.cc124 EXPECT_EQ(erase_if(s, [](int) { return true; }), 5); in TEST()
130 EXPECT_EQ(erase_if(s, [](int) { return false; }), 0); in TEST()
136 EXPECT_EQ(erase_if(s, [](int k) { return k % 2 == 1; }), 3); in TEST()
142 EXPECT_EQ(erase_if(s, IsEven), 2); in TEST()
148 EXPECT_EQ(erase_if(s, &IsEven), 2); in TEST()
/external/cronet/stable/third_party/libc++/src/test/std/containers/container.adaptors/flat.map/flat.map.erasure/
Derase_if_exceptions.pass.cpp78 auto n = std::erase_if(m, ErasurePredicate()); in main()
105 auto n = std::erase_if(m, ErasurePredicate()); in main()
135 auto n = std::erase_if(m, ErasurePredicate()); in main()
/external/cronet/tot/third_party/libc++/src/test/std/containers/container.adaptors/flat.map/flat.map.erasure/
Derase_if_exceptions.pass.cpp78 auto n = std::erase_if(m, ErasurePredicate()); in main()
105 auto n = std::erase_if(m, ErasurePredicate()); in main()
135 auto n = std::erase_if(m, ErasurePredicate()); in main()
/external/swiftshader/third_party/llvm-16.0/llvm/lib/ObjCopy/COFF/
DCOFFObject.cpp40 llvm::erase_if(Symbols, [ToRemove, &Errs](const Symbol &Sym) { in removeSymbols()
96 llvm::erase_if(Sections, [ToRemove, &RemovedSections](const Section &Sec) { in removeSections()
104 llvm::erase_if( in removeSections()
/external/cronet/tot/net/base/
Durl_search_params.cc48 std::erase_if(params_, in DeleteAllWithNames()
54 std::erase_if(params_, in DeleteAllExceptWithNames()
/external/cronet/stable/net/base/
Durl_search_params.cc48 std::erase_if(params_, in DeleteAllWithNames()
54 std::erase_if(params_, in DeleteAllExceptWithNames()
/external/libcxx/test/std/containers/associative/set/set.erasure/
Derase_if.pass.cpp26 ASSERT_SAME_TYPE(void, decltype(std::erase_if(s, p))); in test0()
27 std::erase_if(s, p); in test0()
/external/cronet/tot/third_party/libc++/src/test/std/containers/associative/set/set.erasure/
Derase_if.pass.cpp24 ASSERT_SAME_TYPE(typename S::size_type, decltype(std::erase_if(s, p))); in test0()
25 assert(expected_erased_count == std::erase_if(s, p)); in test0()
/external/cronet/stable/third_party/libc++/src/test/std/containers/associative/set/set.erasure/
Derase_if.pass.cpp24 ASSERT_SAME_TYPE(typename S::size_type, decltype(std::erase_if(s, p))); in test0()
25 assert(expected_erased_count == std::erase_if(s, p)); in test0()
/external/libcxx/test/std/containers/associative/map/map.erasure/
Derase_if.pass.cpp37 ASSERT_SAME_TYPE(void, decltype(std::erase_if(s, p))); in test0()
38 std::erase_if(s, p); in test0()

12345678910>>...14