| /external/libcxx/test/std/experimental/filesystem/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/libcxx/test/std/experimental/filesystem/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()
|
| D | copy.pass.cpp | 53 const directory_iterator it2(it); in TEST_CASE() local
54 TEST_REQUIRE(it2 == it); in TEST_CASE()
55 TEST_CHECK(*it2 == entry); in TEST_CASE()
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/quantiles/ |
| D | weighted_quantiles_summary.h | 137 auto it2 = other_entries.cbegin(); in Merge() local
140 while (it1 != base_entries.cend() && it2 != other_entries.cend()) { in Merge()
141 if (kCompFn(it1->value, it2->value)) { // value1 < value2 in Merge()
146 it1->max_rank + it2->PrevMaxRank()); in Merge()
150 } else if (kCompFn(it2->value, it1->value)) { // value1 > value2 in Merge()
153 entries_.emplace_back(it2->value, it2->weight, in Merge()
154 it2->min_rank + next_min_rank1, in Merge()
155 it2->max_rank + it1->PrevMaxRank()); in Merge()
157 next_min_rank2 = it2->NextMinRank(); in Merge()
158 ++it2; in Merge()
[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/swiftshader/third_party/LLVM/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 131 for (succ_iterator_ty it2 = succ_begin(*it), in ExecuteOneTest()
132 ie2 = succ_end(*it); it2 != ie2; ++it2) in ExecuteOneTest()
133 assert(S.count(*it2) && "Attempt to run invalid changeset!"); in ExecuteOneTest()
228 for (succ_closure_iterator_ty it2 = succ_closure_begin(*it), in DAGDeltaAlgorithmImpl() local
229 ie2 = succ_closure_end(*it); it2 != ie2; ++it2) in DAGDeltaAlgorithmImpl()
230 PredClosure[*it2].insert(*it); in DAGDeltaAlgorithmImpl()
243 for (succ_iterator_ty it2 = succ_begin(*it), in DAGDeltaAlgorithmImpl()
244 ie2 = succ_end(*it); it2 != ie2; ++it2) { in DAGDeltaAlgorithmImpl()
245 if (it2 != succ_begin(*it)) llvm::errs() << ", "; in DAGDeltaAlgorithmImpl()
246 llvm::errs() << "->" << *it2; in DAGDeltaAlgorithmImpl()
[all …]
|
| /external/webrtc/webrtc/modules/desktop_capture/ |
| D | desktop_region.cc | 61 Rows::const_iterator it2 = region.rows_.begin(); in Equals() local
63 if (it2 == region.rows_.end() || in Equals()
64 it1->first != it2->first || in Equals()
65 it1->second->top != it2->second->top || in Equals()
66 it1->second->bottom != it2->second->bottom || in Equals()
67 it1->second->spans != it2->second->spans) { in Equals()
71 ++it2; in Equals()
73 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()
[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()
|
| D | pop_back.invalidation.pass.cpp | 24 typename C::iterator it2 = c.end() - 2; in test() local
33 assert( it2 == it4); in test()
34 assert( *it2 == *it4); in test()
35 assert(&*it2 == &*it4); in test()
|
| D | pop_front.invalidation.pass.cpp | 24 typename C::iterator it2 = c.end() - 1; in test() local
33 assert( it2 == it4); in test()
34 assert( *it2 == *it4); in test()
35 assert(&*it2 == &*it4); in test()
|
| /external/libcxx/test/std/iterators/stream.iterators/istreambuf.iterator/istreambuf.iterator.cons/ |
| D | default.pass.cpp | 32 constexpr T it2; in main() local
33 (void)it2; in main()
41 constexpr T it2; in main() local
42 (void)it2; in main()
|
| /external/libcxx/test/std/iterators/predef.iterators/reverse.iterators/reverse.iter.ops/reverse.iter.opsum/ |
| D | difference_type.pass.cpp | 46 constexpr RI it2 = std::make_reverse_iterator(p + 5); in main() local
47 constexpr RI it3 = 5 + it2; in main()
48 static_assert(it1 != it2, ""); in main()
50 static_assert(it2 != it3, ""); in main()
|
| /external/libcxx/test/std/iterators/predef.iterators/reverse.iterators/reverse.iter.ops/reverse.iter.op+/ |
| D | difference_type.pass.cpp | 45 constexpr RI it2 = std::make_reverse_iterator(p + 5); in main() local
46 constexpr RI it3 = it2 + 5; in main()
47 static_assert(it1 != it2, ""); in main()
49 static_assert(it2 != it3, ""); in main()
|
| /external/libcxx/test/std/containers/sequences/forwardlist/ |
| D | incomplete.pass.cpp | 25 std::forward_list<A>::const_iterator it2; member
33 FList::const_iterator it2; member
43 a.it2 = a.d.cbefore_begin(); in main()
50 b.it2 = b.d.cbefore_begin(); in main()
|
| /external/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op.-/ |
| D | difference_type.pass.cpp | 45 constexpr MI it2 = std::make_move_iterator(p + 5); in main() local
46 constexpr MI it3 = it2 - 5; in main()
47 static_assert(it1 != it2, ""); in main()
49 static_assert(it2 != it3, ""); in main()
|
| /external/tensorflow/tensorflow/core/lib/gtl/ |
| D | flatmap_test.cc | 498 NAMap::iterator it2 = map.find(NA(2)); in TEST() local
502 EXPECT_TRUE(it2 != map.end()); in TEST()
504 EXPECT_FALSE(it2 == map.end()); in TEST()
505 EXPECT_TRUE(it1 != it2); in TEST()
506 EXPECT_FALSE(it1 == it2); in TEST()
511 EXPECT_EQ((*it2).first, NA(2)); in TEST()
512 EXPECT_EQ((*it2).second, NA(20)); in TEST()
515 EXPECT_EQ(it2->first, NA(2)); in TEST()
516 EXPECT_EQ(it2->second, NA(20)); in TEST()
520 NAMap::iterator copy_it2 = it2; in TEST()
[all …]
|
| D | flatset_test.cc | 415 NASet::iterator it2 = set.find(NA(2)); in TEST() local
419 EXPECT_TRUE(it2 != set.end()); in TEST()
421 EXPECT_FALSE(it2 == set.end()); in TEST()
422 EXPECT_TRUE(it1 != it2); in TEST()
423 EXPECT_FALSE(it1 == it2); in TEST()
427 EXPECT_EQ(*it2, NA(2)); in TEST()
429 EXPECT_EQ(it2->value, 2); in TEST()
433 NASet::iterator copy_it2 = it2; in TEST()
442 EXPECT_TRUE(copy_it2 != it2); in TEST()
454 EXPECT_EQ(*it2, NA(2)); in TEST()
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/MC/ |
| D | MCAssembler.cpp | 589 for (MCSectionData::iterator it2 = SD->begin(), in Finish() local
590 ie2 = SD->end(); it2 != ie2; ++it2) in Finish()
591 it2->setLayoutOrder(FragmentIndex++); in Finish()
617 for (MCSectionData::iterator it2 = it->begin(), in Finish() local
618 ie2 = it->end(); it2 != ie2; ++it2) { in Finish()
619 MCDataFragment *DF = dyn_cast<MCDataFragment>(it2); in Finish()
629 MCInstFragment *IF = dyn_cast<MCInstFragment>(it2); in Finish()
771 for (MCSectionData::iterator it2 = SD.begin(), in LayoutSectionOnce() local
772 ie2 = SD.end(); it2 != ie2; ++it2) { in LayoutSectionOnce()
775 switch(it2->getKind()) { in LayoutSectionOnce()
[all …]
|
| /external/tensorflow/tensorflow/compiler/xla/ |
| D | array.h | 116 for (const auto& it2 : it1) {
117 values_[idx] = it2;
133 for (const auto& it2 : it1) {
134 values_[idx] = static_cast<T>(it2);
148 for (const auto& it2 : it1) {
149 for (const auto& it3 : it2) {
169 for (const auto& it2 : it1) {
170 for (const auto& it3 : it2) {
187 for (const auto& it2 : it1) {
188 for (const auto& it3 : it2) {
[all …]
|