Lines Matching defs:It
282 for (T::iterator It = Tt.begin(), E = Tt.end(); It != E; ++It) {
283 printf("I found %d\n", *It);
286 // CHECK-FIXES: for (int & It : Tt)
287 // CHECK-FIXES-NEXT: printf("I found %d\n", It);
292 for (Q::const_iterator It = Qq.begin(), E = Qq.end(); It != E; ++It) {
293 printf("I found %d\n", *It);
296 // CHECK-FIXES: for (int & It : Qq)
297 // CHECK-FIXES-NEXT: printf("I found %d\n", It);
300 for (T::iterator It = Pt->begin(), E = Pt->end(); It != E; ++It) {
301 printf("I found %d\n", *It);
304 // CHECK-FIXES: for (int & It : *Pt)
305 // CHECK-FIXES-NEXT: printf("I found %d\n", It);
308 for (S::iterator It = Ss.begin(), E = Ss.end(); It != E; ++It) {
309 printf("s has value %d\n", (*It).X);
312 // CHECK-FIXES: for (auto & It : Ss)
313 // CHECK-FIXES-NEXT: printf("s has value %d\n", It.X);
316 for (S::iterator It = Ps->begin(), E = Ps->end(); It != E; ++It) {
317 printf("s has value %d\n", (*It).X);
323 for (S::const_iterator It = Ss.cbegin(), E = Ss.cend(); It != E; ++It) {
324 printf("s has value %d\n", (*It).X);
327 // CHECK-FIXES: for (auto It : Ss)
328 // CHECK-FIXES-NEXT: printf("s has value %d\n", It.X);
330 for (S::iterator It = Ss.begin(), E = Ss.end(); It != E; ++It) {
331 printf("s has value %d\n", It->X);
334 // CHECK-FIXES: for (auto & It : Ss)
335 // CHECK-FIXES-NEXT: printf("s has value %d\n", It.X);
337 for (S::iterator It = Ss.begin(), E = Ss.end(); It != E; ++It) {
338 It->X = 3;
341 // CHECK-FIXES: for (auto & It : Ss)
342 // CHECK-FIXES-NEXT: It.X = 3;
344 for (S::iterator It = Ss.begin(), E = Ss.end(); It != E; ++It) {
345 (*It).X = 3;
348 // CHECK-FIXES: for (auto & It : Ss)
349 // CHECK-FIXES-NEXT: It.X = 3;
351 for (S::iterator It = Ss.begin(), E = Ss.end(); It != E; ++It) {
352 It->nonConstFun(4, 5);
355 // CHECK-FIXES: for (auto & It : Ss)
356 // CHECK-FIXES-NEXT: It.nonConstFun(4, 5);
359 for (U::iterator It = Uu.begin(), E = Uu.end(); It != E; ++It) {
360 printf("s has value %d\n", It->X);
363 // CHECK-FIXES: for (auto & It : Uu)
364 // CHECK-FIXES-NEXT: printf("s has value %d\n", It.X);
366 for (U::iterator It = Uu.begin(), E = Uu.end(); It != E; ++It) {
367 printf("s has value %d\n", (*It).X);
370 // CHECK-FIXES: for (auto & It : Uu)
371 // CHECK-FIXES-NEXT: printf("s has value %d\n", It.X);
373 for (U::iterator It = Uu.begin(), E = Uu.end(); It != E; ++It) {
374 Val* a = It.operator->();
385 for (dependent<int>::iterator It = V.begin(), E = V.end();
386 It != E; ++It) {
387 printf("Fibonacci number is %d\n", *It);
390 // CHECK-FIXES: for (int & It : V)
391 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", It);
393 for (dependent<int>::iterator It(V.begin()), E = V.end();
394 It != E; ++It) {
395 printf("Fibonacci number is %d\n", *It);
398 // CHECK-FIXES: for (int & It : V)
399 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", It);
402 for (doublyDependent<int, int>::iterator It = Intmap.begin(), E = Intmap.end();
403 It != E; ++It) {
404 printf("Intmap[%d] = %d", It->first, It->second);
407 // CHECK-FIXES: for (auto & It : Intmap)
408 // CHECK-FIXES: printf("Intmap[%d] = %d", It.first, It.second);
462 for (S::iterator It = begin(Ss), E = end(Ss); It != E; ++It) {
463 printf("s0 has value %d\n", (*It).X);
466 // CHECK-FIXES: for (auto & It : Ss)
467 // CHECK-FIXES-NEXT: printf("s0 has value %d\n", It.X);
469 for (S::iterator It = std::begin(Ss), E = std::end(Ss); It != E; ++It) {
470 printf("s1 has value %d\n", (*It).X);
473 // CHECK-FIXES: for (auto & It : Ss)
474 // CHECK-FIXES-NEXT: printf("s1 has value %d\n", It.X);
476 for (S::iterator It = begin(*Ps), E = end(*Ps); It != E; ++It) {
477 printf("s2 has value %d\n", (*It).X);
480 // CHECK-FIXES: for (auto & It : *Ps)
481 // CHECK-FIXES-NEXT: printf("s2 has value %d\n", It.X);
483 for (S::iterator It = begin(*Ps); It != end(*Ps); ++It) {
484 printf("s3 has value %d\n", (*It).X);
487 // CHECK-FIXES: for (auto & It : *Ps)
488 // CHECK-FIXES-NEXT: printf("s3 has value %d\n", It.X);
490 for (S::const_iterator It = cbegin(Ss), E = cend(Ss); It != E; ++It) {
491 printf("s4 has value %d\n", (*It).X);
494 // CHECK-FIXES: for (auto It : Ss)
495 // CHECK-FIXES-NEXT: printf("s4 has value %d\n", It.X);
504 for (S::const_iterator It = Ss.begin(), E = Ss.end(); It != E; ++It) {
505 printf("s has value %d\n", (*It).X);
508 // CHECK-FIXES: for (auto It : Ss)
509 // CHECK-FIXES-NEXT: printf("s has value %d\n", It.X);
512 for (S::const_iterator It = Ps->begin(), E = Ps->end(); It != E; ++It) {
513 printf("s has value %d\n", (*It).X);
520 for (dependent<int>::const_iterator It = V.begin(), E = V.end();
521 It != E; ++It) {
522 printf("Fibonacci number is %d\n", *It);
525 // CHECK-FIXES: for (int It : V)
526 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", It);
528 for (dependent<int>::const_iterator It(V.begin()), E = V.end();
529 It != E; ++It) {
530 printf("Fibonacci number is %d\n", *It);
533 // CHECK-FIXES: for (int It : V)
534 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", It);