| /external/libcxx/test/std/input.output/filesystems/class.rec.dir.itr/rec.dir.itr.members/ |
| D | move_assign.pass.cpp | 125 recursive_directory_iterator it2 = createDifferentInterestingIterator(); in TEST_CASE() local
126 const recursive_directory_iterator it2_copy(it2); in TEST_CASE()
127 TEST_REQUIRE(it2 != it); in TEST_CASE()
128 TEST_CHECK(it2.options() != it.options()); in TEST_CASE()
129 TEST_CHECK(it2.depth() != it.depth()); in TEST_CASE()
130 TEST_CHECK(it2.recursion_pending() != it.recursion_pending()); in TEST_CASE()
131 TEST_CHECK(*it2 != entry); in TEST_CASE()
133 it2 = std::move(it); in TEST_CASE()
134 TEST_REQUIRE(it2 != it2_copy && it2 != endIt); in TEST_CASE()
135 TEST_CHECK(it2.options() == it_copy.options()); in TEST_CASE()
[all …]
|
| D | copy_assign.pass.cpp | 114 recursive_directory_iterator it2 = createDifferentInterestingIterator(); in TEST_CASE() local
115 TEST_REQUIRE(it2 != it); in TEST_CASE()
116 TEST_CHECK(it2.options() != it.options()); in TEST_CASE()
117 TEST_CHECK(it2.depth() != it.depth()); in TEST_CASE()
118 TEST_CHECK(it2.recursion_pending() != it.recursion_pending()); in TEST_CASE()
119 TEST_CHECK(*it2 != entry); in TEST_CASE()
121 it2 = it; in TEST_CASE()
122 TEST_REQUIRE(it2 == it); in TEST_CASE()
123 TEST_CHECK(it2.options() == it.options()); in TEST_CASE()
124 TEST_CHECK(it2.depth() == it.depth()); in TEST_CASE()
[all …]
|
| D | recursion_pending.pass.cpp | 49 recursive_directory_iterator it2(no_rec_pending_it); in TEST_CASE() local
50 TEST_CHECK(it2.recursion_pending() == false); in TEST_CASE()
60 recursive_directory_iterator it2(StaticEnv::Dir); in TEST_CASE() local
61 it2 = no_rec_pending_it; in TEST_CASE()
62 TEST_CHECK(it2.recursion_pending() == false); in TEST_CASE()
81 recursive_directory_iterator it2(std::move(it_cp2)); in TEST_CASE() local
82 TEST_CHECK(it2.recursion_pending() == false); in TEST_CASE()
91 recursive_directory_iterator it2(StaticEnv::Dir); in TEST_CASE() local
93 it2 = std::move(it_cp2); in TEST_CASE()
94 TEST_CHECK(it2.recursion_pending() == false); in TEST_CASE()
|
| D | copy.pass.cpp | 69 const recursive_directory_iterator it2(it); in TEST_CASE() local
72 TEST_REQUIRE(it2 == it); in TEST_CASE()
73 TEST_CHECK(*it2 == entry); in TEST_CASE()
74 TEST_CHECK(it2.depth() == 1); in TEST_CASE()
75 TEST_CHECK(it2.recursion_pending() == false); in TEST_CASE()
|
| D | move.pass.cpp | 71 const recursive_directory_iterator it2(std::move(it)); in TEST_CASE() local
74 TEST_REQUIRE(it2 != endIt); in TEST_CASE()
75 TEST_CHECK(*it2 == entry); in TEST_CASE()
76 TEST_CHECK(it2.depth() == 1); in TEST_CASE()
77 TEST_CHECK(it2.recursion_pending() == false); in TEST_CASE()
|
| /external/llvm-project/libcxx/test/std/input.output/filesystems/class.rec.dir.itr/rec.dir.itr.members/ |
| D | move_assign.pass.cpp | 127 recursive_directory_iterator it2 = createDifferentInterestingIterator(static_env); in TEST_CASE() local
128 const recursive_directory_iterator it2_copy(it2); in TEST_CASE()
129 TEST_REQUIRE(it2 != it); in TEST_CASE()
130 TEST_CHECK(it2.options() != it.options()); in TEST_CASE()
131 TEST_CHECK(it2.depth() != it.depth()); in TEST_CASE()
132 TEST_CHECK(it2.recursion_pending() != it.recursion_pending()); in TEST_CASE()
133 TEST_CHECK(*it2 != entry); in TEST_CASE()
135 it2 = std::move(it); in TEST_CASE()
136 TEST_REQUIRE(it2 != it2_copy && it2 != endIt); in TEST_CASE()
137 TEST_CHECK(it2.options() == it_copy.options()); in TEST_CASE()
[all …]
|
| D | copy_assign.pass.cpp | 116 recursive_directory_iterator it2 = createDifferentInterestingIterator(static_env); in TEST_CASE() local
117 TEST_REQUIRE(it2 != it); in TEST_CASE()
118 TEST_CHECK(it2.options() != it.options()); in TEST_CASE()
119 TEST_CHECK(it2.depth() != it.depth()); in TEST_CASE()
120 TEST_CHECK(it2.recursion_pending() != it.recursion_pending()); in TEST_CASE()
121 TEST_CHECK(*it2 != entry); in TEST_CASE()
123 it2 = it; in TEST_CASE()
124 TEST_REQUIRE(it2 == it); in TEST_CASE()
125 TEST_CHECK(it2.options() == it.options()); in TEST_CASE()
126 TEST_CHECK(it2.depth() == it.depth()); in TEST_CASE()
[all …]
|
| D | recursion_pending.pass.cpp | 50 recursive_directory_iterator it2(no_rec_pending_it); in TEST_CASE() local
51 TEST_CHECK(it2.recursion_pending() == false); in TEST_CASE()
61 recursive_directory_iterator it2(static_env.Dir); in TEST_CASE() local
62 it2 = no_rec_pending_it; in TEST_CASE()
63 TEST_CHECK(it2.recursion_pending() == false); in TEST_CASE()
83 recursive_directory_iterator it2(std::move(it_cp2)); in TEST_CASE() local
84 TEST_CHECK(it2.recursion_pending() == false); in TEST_CASE()
93 recursive_directory_iterator it2(static_env.Dir); in TEST_CASE() local
95 it2 = std::move(it_cp2); in TEST_CASE()
96 TEST_CHECK(it2.recursion_pending() == false); in TEST_CASE()
|
| D | copy.pass.cpp | 69 const recursive_directory_iterator it2(it); in TEST_CASE() local
72 TEST_REQUIRE(it2 == it); in TEST_CASE()
73 TEST_CHECK(*it2 == entry); in TEST_CASE()
74 TEST_CHECK(it2.depth() == 1); in TEST_CASE()
75 TEST_CHECK(it2.recursion_pending() == false); in TEST_CASE()
|
| D | move.pass.cpp | 71 const recursive_directory_iterator it2(std::move(it)); in TEST_CASE() local
74 TEST_REQUIRE(it2 != endIt); in TEST_CASE()
75 TEST_CHECK(*it2 == entry); in TEST_CASE()
76 TEST_CHECK(it2.depth() == 1); in TEST_CASE()
77 TEST_CHECK(it2.recursion_pending() == false); in TEST_CASE()
|
| /external/libcxx/test/std/input.output/filesystems/class.directory_iterator/directory_iterator.members/ |
| D | move_assign.pass.cpp | 83 directory_iterator it2(testDir); in TEST_CASE() local
84 TEST_REQUIRE(it2 != it); in TEST_CASE()
85 const path entry2 = *it2; in TEST_CASE()
88 it2 = std::move(it); in TEST_CASE()
89 TEST_REQUIRE(it2 != directory_iterator{}); in TEST_CASE()
90 TEST_CHECK(*it2 == entry); in TEST_CASE()
96 directory_iterator it2; in TEST_CASE() local
97 directory_iterator& ref = (it2 = it); in TEST_CASE()
98 TEST_CHECK(&ref == &it2); in TEST_CASE()
106 directory_iterator it2(StaticEnv::Dir); in TEST_CASE() local
[all …]
|
| D | copy_assign.pass.cpp | 79 directory_iterator it2(testDir); in TEST_CASE() local
80 TEST_REQUIRE(it2 != it); in TEST_CASE()
81 const path entry2 = *it2; in TEST_CASE()
84 it2 = it; in TEST_CASE()
85 TEST_REQUIRE(it2 == it); in TEST_CASE()
86 TEST_CHECK(*it2 == entry); in TEST_CASE()
92 directory_iterator it2; in TEST_CASE() local
93 directory_iterator& ref = (it2 = it); in TEST_CASE()
94 TEST_CHECK(&ref == &it2); in TEST_CASE()
|
| /external/llvm-project/libcxx/test/std/input.output/filesystems/class.directory_iterator/directory_iterator.members/ |
| D | move_assign.pass.cpp | 85 directory_iterator it2(testDir); in TEST_CASE() local
86 TEST_REQUIRE(it2 != it); in TEST_CASE()
87 const path entry2 = *it2; in TEST_CASE()
90 it2 = std::move(it); in TEST_CASE()
91 TEST_REQUIRE(it2 != directory_iterator{}); in TEST_CASE()
92 TEST_CHECK(*it2 == entry); in TEST_CASE()
98 directory_iterator it2; in TEST_CASE() local
99 directory_iterator& ref = (it2 = it); in TEST_CASE()
100 TEST_CHECK(&ref == &it2); in TEST_CASE()
109 directory_iterator it2(static_env.Dir); in TEST_CASE() local
[all …]
|
| D | copy_assign.pass.cpp | 81 directory_iterator it2(testDir); in TEST_CASE() local
82 TEST_REQUIRE(it2 != it); in TEST_CASE()
83 const path entry2 = *it2; in TEST_CASE()
86 it2 = it; in TEST_CASE()
87 TEST_REQUIRE(it2 == it); in TEST_CASE()
88 TEST_CHECK(*it2 == entry); in TEST_CASE()
94 directory_iterator it2; in TEST_CASE() local
95 directory_iterator& ref = (it2 = it); in TEST_CASE()
96 TEST_CHECK(&ref == &it2); in TEST_CASE()
|
| /external/tensorflow/tensorflow/core/kernels/boosted_trees/quantiles/ |
| D | weighted_quantiles_summary.h | 138 auto it2 = other_entries.cbegin(); in Merge() local
141 while (it1 != base_entries.cend() && it2 != other_entries.cend()) { in Merge()
142 if (kCompFn(it1->value, it2->value)) { // value1 < value2 in Merge()
147 it1->max_rank + it2->PrevMaxRank()); in Merge()
151 } else if (kCompFn(it2->value, it1->value)) { // value1 > value2 in Merge()
154 entries_.emplace_back(it2->value, it2->weight, in Merge()
155 it2->min_rank + next_min_rank1, in Merge()
156 it2->max_rank + it1->PrevMaxRank()); in Merge()
158 next_min_rank2 = it2->NextMinRank(); in Merge()
159 ++it2; in Merge()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 129 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in ExecuteOneTest()
130 it2 != ie2; ++it2) in ExecuteOneTest()
131 assert(S.count(*it2) && "Attempt to run invalid changeset!"); in ExecuteOneTest()
221 for (succ_closure_iterator_ty it2 = succ_closure_begin(*it), in DAGDeltaAlgorithmImpl() local
222 ie2 = succ_closure_end(*it); it2 != ie2; ++it2) in DAGDeltaAlgorithmImpl()
223 PredClosure[*it2].insert(*it); in DAGDeltaAlgorithmImpl()
237 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in DAGDeltaAlgorithmImpl()
238 it2 != ie2; ++it2) { in DAGDeltaAlgorithmImpl()
239 if (it2 != succ_begin(*it)) in DAGDeltaAlgorithmImpl()
241 llvm::errs() << "->" << *it2; in DAGDeltaAlgorithmImpl()
[all …]
|
| /external/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 130 for (succ_iterator_ty it2 = succ_begin(*it), in ExecuteOneTest()
131 ie2 = succ_end(*it); it2 != ie2; ++it2) in ExecuteOneTest()
132 assert(S.count(*it2) && "Attempt to run invalid changeset!"); in ExecuteOneTest()
222 for (succ_closure_iterator_ty it2 = succ_closure_begin(*it), in DAGDeltaAlgorithmImpl() local
223 ie2 = succ_closure_end(*it); it2 != ie2; ++it2) in DAGDeltaAlgorithmImpl()
224 PredClosure[*it2].insert(*it); in DAGDeltaAlgorithmImpl()
237 for (succ_iterator_ty it2 = succ_begin(*it), in DAGDeltaAlgorithmImpl()
238 ie2 = succ_end(*it); it2 != ie2; ++it2) { in DAGDeltaAlgorithmImpl()
239 if (it2 != succ_begin(*it)) llvm::errs() << ", "; in DAGDeltaAlgorithmImpl()
240 llvm::errs() << "->" << *it2; in DAGDeltaAlgorithmImpl()
[all …]
|
| /external/llvm-project/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 129 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in ExecuteOneTest()
130 it2 != ie2; ++it2) in ExecuteOneTest()
131 assert(S.count(*it2) && "Attempt to run invalid changeset!"); in ExecuteOneTest()
221 for (succ_closure_iterator_ty it2 = succ_closure_begin(*it), in DAGDeltaAlgorithmImpl() local
222 ie2 = succ_closure_end(*it); it2 != ie2; ++it2) in DAGDeltaAlgorithmImpl()
223 PredClosure[*it2].insert(*it); in DAGDeltaAlgorithmImpl()
237 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in DAGDeltaAlgorithmImpl()
238 it2 != ie2; ++it2) { in DAGDeltaAlgorithmImpl()
239 if (it2 != succ_begin(*it)) in DAGDeltaAlgorithmImpl()
241 llvm::errs() << "->" << *it2; in DAGDeltaAlgorithmImpl()
[all …]
|
| /external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| D | erase_iter.invalidation.pass.cpp | 25 typename C::iterator it2 = c.end() - 1; in del_at_start() local
34 assert( it2 == it4); in del_at_start()
35 assert( *it2 == *it4); in del_at_start()
36 assert(&*it2 == &*it4); in del_at_start()
44 typename C::iterator it2 = first - 1; in del_at_end() local
53 assert( it2 == it4); in del_at_end()
54 assert( *it2 == *it4); in del_at_end()
55 assert(&*it2 == &*it4); in del_at_end()
|
| D | erase_iter_iter.invalidation.pass.cpp | 28 typename C::iterator it2 = c.end() - 1; in del_at_start() local
37 assert( it2 == it4); in del_at_start()
38 assert( *it2 == *it4); in del_at_start()
39 assert(&*it2 == &*it4); in del_at_start()
48 typename C::iterator it2 = first - 1; in del_at_end() local
57 assert( it2 == it4); in del_at_end()
58 assert( *it2 == *it4); in del_at_end()
59 assert(&*it2 == &*it4); in del_at_end()
|
| /external/llvm-project/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| D | erase_iter.invalidation.pass.cpp | 26 typename C::iterator it2 = c.end() - 1; in del_at_start() local
35 assert( it2 == it4); in del_at_start()
36 assert( *it2 == *it4); in del_at_start()
37 assert(&*it2 == &*it4); in del_at_start()
45 typename C::iterator it2 = first - 1; in del_at_end() local
54 assert( it2 == it4); in del_at_end()
55 assert( *it2 == *it4); in del_at_end()
56 assert(&*it2 == &*it4); in del_at_end()
|
| D | erase_iter_iter.invalidation.pass.cpp | 29 typename C::iterator it2 = c.end() - 1; in del_at_start() local
38 assert( it2 == it4); in del_at_start()
39 assert( *it2 == *it4); in del_at_start()
40 assert(&*it2 == &*it4); in del_at_start()
49 typename C::iterator it2 = first - 1; in del_at_end() local
58 assert( it2 == it4); in del_at_end()
59 assert( *it2 == *it4); in del_at_end()
60 assert(&*it2 == &*it4); in del_at_end()
|
| /external/webrtc/modules/desktop_capture/ |
| D | desktop_region.cc | 63 Rows::const_iterator it2 = region.rows_.begin(); in Equals() local
65 if (it2 == region.rows_.end() || it1->first != it2->first || in Equals()
66 it1->second->top != it2->second->top || in Equals()
67 it1->second->bottom != it2->second->bottom || in Equals()
68 it1->second->spans != it2->second->spans) { in Equals()
72 ++it2; in Equals()
74 return it2 == region.rows_.end(); in Equals()
182 Rows::const_iterator it2 = region2.rows_.begin(); in Intersect() local
184 if (it1 == end1 || it2 == end2) in Intersect()
187 while (it1 != end1 && it2 != end2) { in Intersect()
[all …]
|
| /external/Reactive-Extensions/RxCpp/Ix/CPP/src/cpplinq/ |
| D | linq_iterators.hpp | 48 operator!=(const Iter& it, const Iter& it2) { in operator !=() argument
49 return !(it == it2); in operator !=()
56 operator>(const Iter& it, const Iter& it2) { in operator >() argument
57 return it2 < it; in operator >()
64 operator<=(const Iter& it, const Iter& it2) { in operator <=() argument
65 return !(it2 < it); in operator <=()
72 operator>=(const Iter& it, const Iter& it2) { in operator >=() argument
73 return !(it < it2); in operator >=()
|
| /external/pigweed/pw_containers/public/pw_containers/ |
| D | flat_map.h | 121 iterator it2 = it - 1; in ConstexprSort() local
123 *(it2 + 1) = std::move(*it2); in ConstexprSort()
124 if (it2 == data || !(temp.first < it2[-1].first)) { in ConstexprSort()
127 --it2; in ConstexprSort()
129 *it2 = std::move(temp); in ConstexprSort()
|