| /third_party/boost/boost/polygon/detail/ |
| D | polygon_45_touch.hpp | 145 for(std::vector<std::pair<int, int> >::const_iterator itr2 = count2.counts.begin(); in operator ()() local
146 itr2 != count2.counts.end(); ++itr2) { in operator ()()
147 if(itr2->second > 0) { in operator ()()
148 output_set.insert(output_set.end(), itr2->first); in operator ()()
196 typename TouchSetData::iterator itr2 = itr; in performTouch() local
197 ++itr2; in performTouch()
198 for(; itr2 != tsd.end() && itr2->first == itr->first; ++itr2) { in performTouch()
199 (itr->second) += (itr2->second); //accumulate in performTouch()
202 itr = itr2; in performTouch()
208 typename TSD::iterator itr2 = itr; in performTouch() local
[all …]
|
| D | property_merge_45.hpp | 119 typename MergeSetData::iterator itr2 = itr; in performMerge() local
120 ++itr2; in performMerge()
121 for(; itr2 != tsd.end() && itr2->first == itr->first; ++itr2) { in performMerge()
122 (itr->second) += (itr2->second); //accumulate in performMerge()
125 itr = itr2; in performMerge()
129 typename TSD::iterator itr2 = itr; in performMerge() local
130 ++itr2; in performMerge()
131 while(itr2 != tsd_.end() && itr2->first.x() == itr->first.x()) { in performMerge()
132 ++itr2; in performMerge()
134 scanline.scan(result, itr, itr2); in performMerge()
[all …]
|
| D | boolean_op.hpp | 273 iterator_type_2 itr2, iterator_type_2 itr2_end, in applyBooleanBinaryOp() argument
292 if(itr2 != itr2_end) { in applyBooleanBinaryOp()
293 if((*itr2).first < prevCoord || in applyBooleanBinaryOp()
294 ((*itr2).first == prevCoord && (*itr2).second.first < prevPosition)) { in applyBooleanBinaryOp()
295 prevCoord = (*itr2).first; in applyBooleanBinaryOp()
296 prevPosition = (*itr2).second.first; in applyBooleanBinaryOp()
298 count[1] += (*itr2).second.second; in applyBooleanBinaryOp()
299 ++itr2; in applyBooleanBinaryOp()
300 } else if((*itr2).first == prevCoord && (*itr2).second.first == prevPosition) { in applyBooleanBinaryOp()
301 count[1] += (*itr2).second.second; in applyBooleanBinaryOp()
[all …]
|
| D | property_merge.hpp | 430 typename T::iterator itr2 = itr; in assertRedundant() local
431 ++itr2; in assertRedundant()
432 while(itr2 != t.end()) { in assertRedundant()
433 if((*itr).second == (*itr2).second) in assertRedundant()
435 itr = itr2; in assertRedundant()
436 ++itr2; in assertRedundant()
484 for(typename property_set::iterator itr2 = p2.begin(); itr2 != p2.end(); ++itr2) { in insertEdges() local
485 if(*itr != *itr2) { in insertEdges()
486 graph[*itr].insert(*itr2); in insertEdges()
487 graph[*itr2].insert(*itr); in insertEdges()
|
| D | max_cover.hpp | 110 for(typename Node::iterator itr2 = node->begin(); itr2 != node->end(); ++itr2) { in getMaxCover() local
111 Interval nodeIvl3 = (*itr2)->rect.get(orient); in getMaxCover()
|
| D | polygon_set_view.hpp | 186 literator itr1, itr2; in insert_into_view_arg() local
188 itr2 = polygon_set_traits<arg_type>::end(arg); in insert_into_view_arg()
189 dest.insert(itr1, itr2); in insert_into_view_arg()
|
| D | polygon_90_set_view.hpp | 213 literator itr1, itr2; in insert_into_view_arg() local
215 itr2 = polygon_90_set_traits<arg_type>::end(arg); in insert_into_view_arg()
216 dest.insert(itr1, itr2, orient); in insert_into_view_arg()
|
| D | scan_arbitrary.hpp | 2798 for(typename key_type::const_iterator itr2 = in operator ()() local
2799 right.begin(); itr2 != right.end(); ++itr2) { in operator ()()
2800 output_set.insert(output_set.end(), *itr2); in operator ()()
2808 for(typename key_type::const_iterator itr2 = in operator ()() local
2809 right.begin(); itr2 != right.end(); ++itr2) { in operator ()()
2810 output_set2.insert(output_set2.end(), *itr2); in operator ()()
|
| D | boolean_op_45.hpp | 906 typename Scan45Data::iterator itr2 = testData.lower_bound(Scan45Element(4, 14, -1)); in testScan45Data() local
907 if(itr1 != itr2) stdcout << "test1 failed\n"; in testScan45Data()
|
| /third_party/mindspore/tests/ut/python/dataset/ |
| D | test_iterator.py | 95 itr2 = data.create_tuple_iterator(num_epochs=1)
105 del itr2
114 itr2 = data.create_tuple_iterator(num_epochs=1)
119 itr2.__next__()
|
| /third_party/boost/boost/polygon/ |
| D | polygon_90_set_data.hpp | 463 typename std::vector<point_data<coordinate_type> >::iterator itr2 = poly.begin(); in remove_colinear_pts() local
464 typename std::vector<point_data<coordinate_type> >::iterator itr3 = itr2; in remove_colinear_pts()
468 if(((*itr).x() == (*itr2).x() && (*itr).x() == (*itr3).x()) || in remove_colinear_pts()
469 ((*itr).y() == (*itr2).y() && (*itr).y() == (*itr3).y()) ) { in remove_colinear_pts()
473 itr = itr2; in remove_colinear_pts()
474 ++itr2; in remove_colinear_pts()
476 *itr2 = *itr3; in remove_colinear_pts()
479 if(((*itr).x() == (*itr2).x() && (*itr).x() == (*itr3).x()) || in remove_colinear_pts()
480 ((*itr).y() == (*itr2).y() && (*itr).y() == (*itr3).y()) ) { in remove_colinear_pts()
815 iterator_type_2 itr2, iterator_type_2 itr2_end, in applyBooleanBinaryOp() argument
[all …]
|
| /third_party/gstreamer/gstreamer/gst/ |
| D | gsturi.c | 1093 GList *itr1, *itr2; in _gst_uri_compare_lists() local
1096 for (itr1 = first, itr2 = second; in _gst_uri_compare_lists()
1097 itr1 != NULL || itr2 != NULL; itr1 = itr1->next, itr2 = itr2->next) { in _gst_uri_compare_lists()
1100 if (itr2 == NULL) in _gst_uri_compare_lists()
1102 result = cmp_fn (itr1->data, itr2->data); in _gst_uri_compare_lists()
|
| /third_party/skia/experimental/wasm-skp-debugger/debugger/ |
| D | anim.mskp | 11777 …��q�1�`�H���t>�y���q�u�կ�ʩ�#c�,�E囦��2/|Ӛ(��[�ӌ1k���eY�� �����w�� e��itr2��m[�<� �efs�I�绻���…
|