| /external/libcxx/test/libcxx/debug/containers/ |
| D | db_sequence_container_iterators.pass.cpp | 126 iterator it1, it2, it3; in AssignInvalidates() local
129 it1 = C.begin(); in AssignInvalidates()
134 CHECK_DEBUG_THROWS( C.erase(it1) ); in AssignInvalidates()
181 iterator it1 = C1.begin(); in EraseIterIter() local
188 CHECK_DEBUG_THROWS( C1.erase(it1_next, it1) ); // bad range in EraseIterIter()
190 C1.erase(it1, it1_after_next); in EraseIterIter()
191 CHECK_DEBUG_THROWS( C1.erase(it1) ); in EraseIterIter()
203 iterator it1 = C1.end(); in PopBack() local
204 --it1; in PopBack()
206 CHECK_DEBUG_THROWS( C1.erase(it1) ); in PopBack()
[all …]
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/quantiles/ |
| D | weighted_quantiles_summary.h | 128 auto it1 = base_entries.cbegin(); in Merge() local
132 while (it1 != base_entries.cend() && it2 != other_entries.cend()) { in Merge()
133 if (kCompFn(it1->value, it2->value)) { // value1 < value2 in Merge()
136 entries_.emplace_back(it1->value, it1->weight, in Merge()
137 it1->min_rank + next_min_rank2, in Merge()
138 it1->max_rank + it2->PrevMaxRank()); in Merge()
140 next_min_rank1 = it1->NextMinRank(); in Merge()
141 ++it1; in Merge()
142 } else if (kCompFn(it2->value, it1->value)) { // value1 > value2 in Merge()
147 it2->max_rank + it1->PrevMaxRank()); in Merge()
[all …]
|
| /external/tensorflow/tensorflow/core/kernels/boosted_trees/quantiles/ |
| D | weighted_quantiles_summary.h | 136 auto it1 = base_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()
144 entries_.emplace_back(it1->value, it1->weight, in Merge()
145 it1->min_rank + next_min_rank2, in Merge()
146 it1->max_rank + it2->PrevMaxRank()); in Merge()
148 next_min_rank1 = it1->NextMinRank(); in Merge()
149 ++it1; in Merge()
150 } else if (kCompFn(it2->value, it1->value)) { // value1 > value2 in Merge()
155 it2->max_rank + it1->PrevMaxRank()); in Merge()
[all …]
|
| /external/webrtc/webrtc/modules/desktop_capture/ |
| D | desktop_region.cc | 60 Rows::const_iterator it1 = rows_.begin(); in Equals() local
62 while (it1 != 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()
70 ++it1; in Equals()
180 Rows::const_iterator it1 = region1.rows_.begin(); in Intersect() local
184 if (it1 == end1 || it2 == end2) in Intersect()
187 while (it1 != end1 && it2 != end2) { in Intersect()
[all …]
|
| /external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| D | erase_iter.invalidation.pass.cpp | 24 typename C::iterator it1 = first + 1; in del_at_start() local
31 assert( it1 == it3); in del_at_start()
32 assert( *it1 == *it3); in del_at_start()
33 assert(&*it1 == &*it3); in del_at_start()
43 typename C::iterator it1 = c.begin(); in del_at_end() local
50 assert( it1 == it3); in del_at_end()
51 assert( *it1 == *it3); in del_at_end()
52 assert(&*it1 == &*it3); in del_at_end()
|
| D | erase_iter_iter.invalidation.pass.cpp | 27 typename C::iterator it1 = last; in del_at_start() local
34 assert( it1 == it3); in del_at_start()
35 assert( *it1 == *it3); in del_at_start()
36 assert(&*it1 == &*it3); in del_at_start()
47 typename C::iterator it1 = c.begin(); in del_at_end() local
54 assert( it1 == it3); in del_at_end()
55 assert( *it1 == *it3); in del_at_end()
56 assert(&*it1 == &*it3); in del_at_end()
|
| D | pop_back.invalidation.pass.cpp | 23 typename C::iterator it1 = c.begin(); in test() local
30 assert( it1 == it3); in test()
31 assert( *it1 == *it3); in test()
32 assert(&*it1 == &*it3); in test()
|
| D | pop_front.invalidation.pass.cpp | 23 typename C::iterator it1 = c.begin() + 1; in test() local
30 assert( it1 == it3); in test()
31 assert( *it1 == *it3); in test()
32 assert(&*it1 == &*it3); in test()
|
| /external/clang/test/CXX/basic/basic.lookup/basic.lookup.classref/ |
| D | p1-cxx11.cpp | 51 T it1; in Foo() local
52 if (it1->end < it1->end) { in Foo()
61 T it1; in Foo2() local
62 if (it1->end < it1->end) { in Foo2()
|
| D | p1.cpp | 82 T it1; in Foo() local
83 if (it1->end < it1->end) { in Foo()
92 T it1; in Foo2() local
93 if (it1->end < it1->end) { in Foo2()
|
| /external/tensorflow/tensorflow/core/grappler/graph_analyzer/ |
| D | sig_node.cc | 181 for (auto it1 = hashed_peers_.begin(), it2 = other.hashed_peers_.begin(); in operator ==() local
182 it1 != hashed_peers_.end(); ++it1, ++it2) { in operator ==()
185 if (it1->link_hash != it2->link_hash) { in operator ==()
188 if (it1->peer->unique_rank_ != it2->peer->unique_rank_) { in operator ==()
431 for (auto it1 = sig_full.begin(), it2 = other.sig_full.begin(); in operator ==() local
432 it1 != sig_full.end(); ++it1, ++it2) { in operator ==()
433 if (*it1 != *it2) { in operator ==()
441 for (auto it1 = nodes.begin(), it2 = other.nodes.begin(); it1 != nodes.end(); in operator ==() local
442 ++it1, ++it2) { in operator ==()
443 if (**it1 != **it2) { in operator ==()
|
| /external/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.nonmember/ |
| D | plus.pass.cpp | 45 constexpr MI it1 = std::make_move_iterator(p); in main() local
47 constexpr MI it3 = it1 + 5; in main()
48 static_assert(it1 != it2, ""); in main()
49 static_assert(it1 != it3, ""); in main()
|
| D | minus.pass.cpp | 47 constexpr MI it1 = std::make_move_iterator(p); in main() local
49 static_assert( it1 - it2 == -1, ""); in main()
50 static_assert( it2 - it1 == 1, ""); in main()
|
| /external/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op.+/ |
| D | difference_type.pass.cpp | 44 constexpr MI it1 = std::make_move_iterator(p); in main() local
46 constexpr MI it3 = it1 + 5; in main()
47 static_assert(it1 != it2, ""); in main()
48 static_assert(it1 != it3, ""); in main()
|
| /external/libcxx/test/std/iterators/predef.iterators/reverse.iterators/reverse.iter.ops/reverse.iter.op-/ |
| D | difference_type.pass.cpp | 44 constexpr RI it1 = std::make_reverse_iterator(p); in main() local
46 constexpr RI it3 = it1 - 5; in main()
47 static_assert(it1 != it2, ""); in main()
48 static_assert(it1 != it3, ""); in main()
|
| /external/libchrome/base/ |
| D | observer_list_unittest.cc | 208 const ObserverList<Foo>::const_iterator it1 = const_observer_list.begin(); in TEST() local
209 EXPECT_EQ(it1, const_observer_list.end()); in TEST()
211 const ObserverList<Foo>::const_iterator it2 = it1; in TEST()
212 EXPECT_EQ(it2, it1); in TEST()
216 EXPECT_EQ(it3, it1); in TEST()
220 EXPECT_EQ(it3, it1); in TEST()
225 const ObserverList<Foo>::iterator it1 = observer_list.begin(); in TEST() local
226 EXPECT_EQ(it1, observer_list.end()); in TEST()
228 const ObserverList<Foo>::iterator it2 = it1; in TEST()
229 EXPECT_EQ(it2, it1); in TEST()
[all …]
|
| /external/tensorflow/tensorflow/core/lib/gtl/ |
| D | flatmap_test.cc | 497 NAMap::iterator it1 = map.find(NA(1)); in TEST() local
501 EXPECT_TRUE(it1 != map.end()); in TEST()
503 EXPECT_FALSE(it1 == map.end()); in TEST()
505 EXPECT_TRUE(it1 != it2); in TEST()
506 EXPECT_FALSE(it1 == it2); in TEST()
509 EXPECT_EQ((*it1).first, NA(1)); in TEST()
510 EXPECT_EQ((*it1).second, NA(10)); in TEST()
513 EXPECT_EQ(it1->first, NA(1)); in TEST()
514 EXPECT_EQ(it1->second, NA(10)); in TEST()
519 NAMap::iterator copy_it1 = it1; in TEST()
[all …]
|
| D | flatset_test.cc | 414 NASet::iterator it1 = set.find(NA(1)); in TEST() local
418 EXPECT_TRUE(it1 != set.end()); in TEST()
420 EXPECT_FALSE(it1 == set.end()); in TEST()
422 EXPECT_TRUE(it1 != it2); in TEST()
423 EXPECT_FALSE(it1 == it2); in TEST()
426 EXPECT_EQ(*it1, NA(1)); in TEST()
428 EXPECT_EQ(it1->value, 1); in TEST()
432 NASet::iterator copy_it1 = it1; in TEST()
441 EXPECT_TRUE(copy_it1 != it1); in TEST()
453 EXPECT_EQ(*it1, NA(1)); in TEST()
[all …]
|
| /external/tensorflow/tensorflow/compiler/xla/ |
| D | array.h | 115 for (const auto& it1 : values) {
116 for (const auto& it2 : it1) {
135 for (const auto& it1 : values) {
136 values_[idx] = static_cast<T>(it1);
153 for (const auto& it1 : values) {
154 for (const auto& it2 : it1) {
168 for (const auto& it1 : values) {
169 for (const auto& it2 : it1) {
192 for (const auto& it1 : values) {
193 for (const auto& it2 : it1) {
[all …]
|
| /external/google-breakpad/src/common/windows/ |
| D | omap.cc | 439 EndpointIndexMap::iterator it1 = std::lower_bound( in BuildEndpointIndexMap() local
447 for (; it1 != it2; ++it1) in BuildEndpointIndexMap()
448 it1->index = Min(i, it1->index); in BuildEndpointIndexMap()
610 EndpointIndexMap::const_iterator it1 = std::lower_bound( in MapAddressRange() local
612 if (it1 == eim.end()) { in MapAddressRange()
616 if (it1 != eim.begin() && query_range.rva < it1->endpoint) in MapAddressRange()
617 --it1; in MapAddressRange()
618 imin = it1->index; in MapAddressRange()
|
| /external/libcxx/test/std/iterators/predef.iterators/reverse.iterators/reverse.iter.ops/reverse.iter.opindex/ |
| D | difference_type.pass.cpp | 44 constexpr RI it1 = std::make_reverse_iterator(p + 5); in main() local
45 static_assert(it1[0] == '5', ""); in main()
46 static_assert(it1[4] == '1', ""); in main()
|
| /external/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op.-/ |
| D | difference_type.pass.cpp | 44 constexpr MI it1 = std::make_move_iterator(p); in main() local
47 static_assert(it1 != it2, ""); in main()
48 static_assert(it1 == it3, ""); in main()
|
| /external/libcxx/test/std/iterators/predef.iterators/reverse.iterators/reverse.iter.ops/reverse.iter.op+/ |
| D | difference_type.pass.cpp | 44 constexpr RI it1 = std::make_reverse_iterator(p); in main() local
47 static_assert(it1 != it2, ""); in main()
48 static_assert(it1 == it3, ""); in main()
|
| /external/libcxx/test/std/iterators/predef.iterators/reverse.iterators/reverse.iter.ops/reverse.iter.opsum/ |
| D | difference_type.pass.cpp | 45 constexpr RI it1 = std::make_reverse_iterator(p); in main() local
48 static_assert(it1 != it2, ""); in main()
49 static_assert(it1 == it3, ""); in main()
|
| /external/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op.decr/ |
| D | pre.pass.cpp | 45 constexpr MI it1 = std::make_move_iterator(p); in main() local
47 static_assert(it1 != it2, ""); in main()
49 static_assert(it1 == it3, ""); in main()
|