| /external/ltp/testcases/kernel/io/disktest/ |
| D | Makefile.windows | 43 -@erase "$(INTDIR)\childmain.obj"
44 -@erase "$(INTDIR)\childmain.sbr"
45 -@erase "$(INTDIR)\dump.obj"
46 -@erase "$(INTDIR)\dump.sbr"
47 -@erase "$(INTDIR)\timer.obj"
48 -@erase "$(INTDIR)\timer.sbr"
49 -@erase "$(INTDIR)\stats.obj"
50 -@erase "$(INTDIR)\stats.sbr"
51 -@erase "$(INTDIR)\Getopt.obj"
52 -@erase "$(INTDIR)\Getopt.sbr"
[all …]
|
| /external/llvm-project/clang/test/Analysis/ |
| D | invalidated-iterator.cpp | 15 V.erase(i); in invalidated_dereference()
26 V.erase(i); in invalidated_prefix_increment()
37 V.erase(i); in invalidated_prefix_decrement()
48 V.erase(i); in invalidated_postfix_increment()
59 V.erase(i); in invalidated_postfix_decrement()
70 V.erase(i); in invalidated_increment_by_2()
81 V.erase(i); in invalidated_increment_by_2_copy()
92 V.erase(i); in invalidated_decrement_by_2()
103 V.erase(i); in invalidated_decrement_by_2_copy()
114 V.erase(i); in invalidated_subscript()
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/unord/unord.set/ |
| D | erase_key.pass.cpp | 55 assert(c.erase(5) == 0); in main()
62 assert(c.erase(2) == 1); in main()
68 assert(c.erase(2) == 0); in main()
74 assert(c.erase(4) == 1); in main()
79 assert(c.erase(4) == 0); in main()
84 assert(c.erase(1) == 1); in main()
88 assert(c.erase(1) == 0); in main()
92 assert(c.erase(3) == 1); in main()
95 assert(c.erase(3) == 0); in main()
112 assert(c.erase(5) == 0); in main()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.set/ |
| D | erase_key.pass.cpp | 55 assert(c.erase(5) == 0); in main()
62 assert(c.erase(2) == 1); in main()
68 assert(c.erase(2) == 0); in main()
74 assert(c.erase(4) == 1); in main()
79 assert(c.erase(4) == 0); in main()
84 assert(c.erase(1) == 1); in main()
88 assert(c.erase(1) == 0); in main()
92 assert(c.erase(3) == 1); in main()
95 assert(c.erase(3) == 0); in main()
112 assert(c.erase(5) == 0); in main()
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| D | erase_key.pass.cpp | 56 assert(c.erase(5) == 0); in main()
63 assert(c.erase(2) == 1); in main()
69 assert(c.erase(2) == 0); in main()
75 assert(c.erase(4) == 1); in main()
80 assert(c.erase(4) == 0); in main()
85 assert(c.erase(1) == 1); in main()
89 assert(c.erase(1) == 0); in main()
93 assert(c.erase(3) == 1); in main()
96 assert(c.erase(3) == 0); in main()
114 assert(c.erase(5) == 0); in main()
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/unord/unord.multiset/ |
| D | erase_key.pass.cpp | 55 assert(c.erase(5) == 0); in main()
62 assert(c.erase(2) == 2); in main()
68 assert(c.erase(2) == 0); in main()
74 assert(c.erase(4) == 1); in main()
79 assert(c.erase(4) == 0); in main()
84 assert(c.erase(1) == 2); in main()
88 assert(c.erase(1) == 0); in main()
92 assert(c.erase(3) == 1); in main()
95 assert(c.erase(3) == 0); in main()
113 assert(c.erase(5) == 0); in main()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| D | erase_key.pass.cpp | 55 assert(c.erase(5) == 0); in main()
62 assert(c.erase(2) == 2); in main()
68 assert(c.erase(2) == 0); in main()
74 assert(c.erase(4) == 1); in main()
79 assert(c.erase(4) == 0); in main()
84 assert(c.erase(1) == 2); in main()
88 assert(c.erase(1) == 0); in main()
92 assert(c.erase(3) == 1); in main()
95 assert(c.erase(3) == 0); in main()
113 assert(c.erase(5) == 0); in main()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| D | erase_key.pass.cpp | 57 assert(c.erase(5) == 0); in main()
64 assert(c.erase(2) == 1); in main()
70 assert(c.erase(2) == 0); in main()
76 assert(c.erase(4) == 1); in main()
81 assert(c.erase(4) == 0); in main()
86 assert(c.erase(1) == 1); in main()
90 assert(c.erase(1) == 0); in main()
94 assert(c.erase(3) == 1); in main()
97 assert(c.erase(3) == 0); in main()
115 assert(c.erase(5) == 0); in main()
[all …]
|
| /external/llvm-project/clang-tools-extra/test/clang-tidy/checkers/ |
| D | bugprone-inaccurate-erase.cpp | 19 void erase(iterator);
20 void erase(iterator, iterator);
30 void erase(const_iterator);
31 void erase(const_iterator, const_iterator);
47 void erase(...);
54 t.erase(std::remove(t.begin(), t.end(), 10)); in g()
58 v.erase(remove(v.begin(), v.end(), 10)); in g()
63 #define ERASE(x, y) x.erase(remove(x.begin(), x.end(), y))
69 v.erase(remove(v.begin(), v.end(), 10)); in main()
72 v.erase(remove(v.begin(), v.end(), 20), v.end()); in main()
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/associative/set/ |
| D | erase_key.pass.cpp | 40 I i = m.erase(9); in main()
52 i = m.erase(4); in main()
63 i = m.erase(1); in main()
73 i = m.erase(8); in main()
82 i = m.erase(3); in main()
90 i = m.erase(6); in main()
97 i = m.erase(7); in main()
103 i = m.erase(2); in main()
108 i = m.erase(5); in main()
130 I i = m.erase(9); in main()
[all …]
|
| D | erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3)); in main()
59 i = m.erase(next(m.cbegin(), 0)); in main()
69 i = m.erase(next(m.cbegin(), 5)); in main()
78 i = m.erase(next(m.cbegin(), 1)); in main()
86 i = m.erase(next(m.cbegin(), 2)); in main()
93 i = m.erase(next(m.cbegin(), 2)); in main()
99 i = m.erase(next(m.cbegin(), 0)); in main()
104 i = m.erase(m.cbegin()); in main()
127 I i = m.erase(next(m.cbegin(), 3)); in main()
138 i = m.erase(next(m.cbegin(), 0)); in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/set/ |
| D | erase_key.pass.cpp | 40 I i = m.erase(9); in main()
52 i = m.erase(4); in main()
63 i = m.erase(1); in main()
73 i = m.erase(8); in main()
82 i = m.erase(3); in main()
90 i = m.erase(6); in main()
97 i = m.erase(7); in main()
103 i = m.erase(2); in main()
108 i = m.erase(5); in main()
130 I i = m.erase(9); in main()
[all …]
|
| D | erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3)); in main()
59 i = m.erase(next(m.cbegin(), 0)); in main()
69 i = m.erase(next(m.cbegin(), 5)); in main()
78 i = m.erase(next(m.cbegin(), 1)); in main()
86 i = m.erase(next(m.cbegin(), 2)); in main()
93 i = m.erase(next(m.cbegin(), 2)); in main()
99 i = m.erase(next(m.cbegin(), 0)); in main()
104 i = m.erase(m.cbegin()); in main()
127 I i = m.erase(next(m.cbegin(), 3)); in main()
138 i = m.erase(next(m.cbegin(), 0)); in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/multiset/ |
| D | erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3)); in main()
59 i = m.erase(next(m.cbegin(), 0)); in main()
69 i = m.erase(next(m.cbegin(), 5)); in main()
78 i = m.erase(next(m.cbegin(), 1)); in main()
86 i = m.erase(next(m.cbegin(), 2)); in main()
93 i = m.erase(next(m.cbegin(), 2)); in main()
99 i = m.erase(next(m.cbegin(), 0)); in main()
104 i = m.erase(m.cbegin()); in main()
127 I i = m.erase(next(m.cbegin(), 3)); in main()
138 i = m.erase(next(m.cbegin(), 0)); in main()
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/associative/multiset/ |
| D | erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3)); in main()
59 i = m.erase(next(m.cbegin(), 0)); in main()
69 i = m.erase(next(m.cbegin(), 5)); in main()
78 i = m.erase(next(m.cbegin(), 1)); in main()
86 i = m.erase(next(m.cbegin(), 2)); in main()
93 i = m.erase(next(m.cbegin(), 2)); in main()
99 i = m.erase(next(m.cbegin(), 0)); in main()
104 i = m.erase(m.cbegin()); in main()
127 I i = m.erase(next(m.cbegin(), 3)); in main()
138 i = m.erase(next(m.cbegin(), 0)); in main()
[all …]
|
| /external/llvm-project/libcxx/test/support/ |
| D | container_debug_tests.h | 269 EXPECT_DEATH( C2.erase(i) );
271 C1.erase(i);
286 EXPECT_DEATH( C1.erase(i) );
287 C2.erase(i);
299 EXPECT_DEATH( C2.erase(it1) ); // wrong container
300 EXPECT_DEATH( C2.erase(C2.end()) ); // erase with end
301 C1.erase(it1_next);
302 EXPECT_DEATH( C1.erase(it1_next) ); // invalidated iterator
303 C1.erase(it1);
304 EXPECT_DEATH( C1.erase(it1) ); // invalidated iterator
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| D | erase_iter.pass.cpp | 41 l1.erase(l1.begin()); in main()
49 l1.erase(l1.begin() + 1); in main()
59 std::vector<int>::iterator j = l1.erase(i); in main()
66 j = l1.erase(j); in main()
72 j = l1.erase(l1.begin()); in main()
85 std::vector<int, min_allocator<int>>::iterator j = l1.erase(i); in main()
92 j = l1.erase(j); in main()
98 j = l1.erase(l1.begin()); in main()
112 v.erase(v.begin()); in main()
113 v.erase(--v.end()); in main()
[all …]
|
| D | erase_iter_iter.pass.cpp | 42 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
51 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); in main()
61 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2)); in main()
71 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3)); in main()
82 outer.erase(outer.begin(), outer.begin()); in main()
94 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
103 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); in main()
113 … std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2)); in main()
123 … std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3)); in main()
134 outer.erase(outer.begin(), outer.begin()); in main()
[all …]
|
| /external/llvm-project/llvm/unittests/ADT/ |
| D | TinyPtrVectorTest.cpp | 303 this->V.erase(this->V.begin()); in TYPED_TEST()
308 this->V.erase(this->V.begin()); in TYPED_TEST()
309 this->TestPtrs.erase(this->TestPtrs.begin()); in TYPED_TEST()
311 this->V.erase(std::next(this->V.begin(), 1)); in TYPED_TEST()
312 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 1)); in TYPED_TEST()
314 this->V.erase(std::next(this->V.begin(), 2)); in TYPED_TEST()
315 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 2)); in TYPED_TEST()
317 this->V.erase(std::next(this->V.begin(), 5)); in TYPED_TEST()
318 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 5)); in TYPED_TEST()
320 this->V.erase(std::next(this->V.begin(), 13)); in TYPED_TEST()
[all …]
|
| D | SparseSetTest.cpp | 67 EXPECT_FALSE(Set.erase(1)); in TEST()
74 I = Set.erase(I); in TEST()
112 EXPECT_TRUE(Set.erase(4)); in TEST()
115 EXPECT_FALSE(Set.erase(4)); in TEST()
122 EXPECT_TRUE(Set.erase(5)); in TEST()
125 EXPECT_FALSE(Set.erase(5)); in TEST()
134 I = Set.erase(Set.end() - 1); in TEST()
139 I = Set.erase(Set.begin() + 1); in TEST()
152 Set.erase(i); in TEST()
180 I = Set.erase(Set.begin()); in TEST()
[all …]
|
| /external/llvm/unittests/ADT/ |
| D | TinyPtrVectorTest.cpp | 293 this->V.erase(this->V.begin()); in TYPED_TEST()
298 this->V.erase(this->V.begin()); in TYPED_TEST()
299 this->TestPtrs.erase(this->TestPtrs.begin()); in TYPED_TEST()
301 this->V.erase(std::next(this->V.begin(), 1)); in TYPED_TEST()
302 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 1)); in TYPED_TEST()
304 this->V.erase(std::next(this->V.begin(), 2)); in TYPED_TEST()
305 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 2)); in TYPED_TEST()
307 this->V.erase(std::next(this->V.begin(), 5)); in TYPED_TEST()
308 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 5)); in TYPED_TEST()
310 this->V.erase(std::next(this->V.begin(), 13)); in TYPED_TEST()
[all …]
|
| D | SparseSetTest.cpp | 67 EXPECT_FALSE(Set.erase(1)); in TEST()
74 I = Set.erase(I); in TEST()
111 EXPECT_TRUE(Set.erase(4)); in TEST()
114 EXPECT_FALSE(Set.erase(4)); in TEST()
121 EXPECT_TRUE(Set.erase(5)); in TEST()
124 EXPECT_FALSE(Set.erase(5)); in TEST()
133 I = Set.erase(Set.end() - 1); in TEST()
138 I = Set.erase(Set.begin() + 1); in TEST()
151 Set.erase(i); in TEST()
179 I = Set.erase(Set.begin()); in TEST()
[all …]
|
| /external/turbine/java/com/google/turbine/types/ |
| D | Erasure.java | 36 public static Type erase(Type ty, Function<TyVarSymbol, SourceTypeBoundClass.TyVarInfo> tenv) { in erase() method in Erasure
59 private static ImmutableList<Type> erase( in erase() method in Erasure
63 result.add(erase(type, tenv)); in erase()
70 return ty.bounds().isEmpty() ? ClassTy.OBJECT : erase(ty.bounds().get(0), tenv); in eraseIntersectionTy()
76 return erase(info.upperBound(), tenv); in eraseTyVar()
81 return ArrayTy.create(erase(ty.elementType(), tenv), ty.annos()); in eraseArrayTy()
102 return erase(ty.bound(), tenv); in eraseWildTy()
110 erase(ty.returnType(), tenv), in erasureMethodTy()
111 ty.receiverType() != null ? erase(ty.receiverType(), tenv) : null, in erasureMethodTy()
112 erase(ty.parameters(), tenv), in erasureMethodTy()
[all …]
|
| /external/llvm-project/clang-tools-extra/docs/clang-tidy/checks/ |
| D | bugprone-inaccurate-erase.rst | 1 .. title:: clang-tidy - bugprone-inaccurate-erase
3 bugprone-inaccurate-erase
7 Checks for inaccurate use of the ``erase()`` method.
12 ``erase()`` method. This check warns when not all of the elements will be
21 xs.erase(std::remove(xs.begin(), xs.end(), 10));
23 Call the two-argument overload of ``erase()`` to remove the subrange:
29 xs.erase(std::remove(xs.begin(), xs.end(), 10), xs.end());
|
| /external/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| D | erase_iter.pass.cpp | 44 std::vector<int>::iterator j = l1.erase(i); in main()
51 j = l1.erase(j); in main()
57 j = l1.erase(l1.begin()); in main()
70 std::vector<int, min_allocator<int>>::iterator j = l1.erase(i); in main()
77 j = l1.erase(j); in main()
83 j = l1.erase(l1.begin()); in main()
97 v.erase(v.begin()); in main()
98 v.erase(--v.end()); in main()
99 v.erase(v.begin()); in main()
|