Lines Matching defs:I
1 // RUN: %check_clang_tidy %s modernize-loop-convert %t -- -- -I %S/Inputs/loop-convert
16 for (int I = 0; I < N; ++I) {
17 Sum += Arr[I];
21 // CHECK-FIXES: for (int I : Arr)
22 // CHECK-FIXES-NEXT: Sum += I;
25 for (int I = 0; I < N; ++I) {
26 printf("Fibonacci number is %d\n", Arr[I]);
27 Sum += Arr[I] + 2;
30 // CHECK-FIXES: for (int I : Arr)
31 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", I);
32 // CHECK-FIXES-NEXT: Sum += I + 2;
34 for (int I = 0; I < N; ++I) {
35 int X = Arr[I];
36 int Y = Arr[I] + 2;
39 // CHECK-FIXES: for (int I : Arr)
40 // CHECK-FIXES-NEXT: int X = I;
41 // CHECK-FIXES-NEXT: int Y = I + 2;
43 for (int I = 0; I < N; ++I) {
45 X = Arr[I];
48 // CHECK-FIXES: for (int I : Arr)
50 // CHECK-FIXES-NEXT: X = I;
52 for (int I = 0; I < N; ++I) {
53 Arr[I] += 1;
56 // CHECK-FIXES: for (int & I : Arr)
57 // CHECK-FIXES-NEXT: I += 1;
59 for (int I = 0; I < N; ++I) {
60 int X = Arr[I] + 2;
61 Arr[I]++;
64 // CHECK-FIXES: for (int & I : Arr)
65 // CHECK-FIXES-NEXT: int X = I + 2;
66 // CHECK-FIXES-NEXT: I++;
68 for (int I = 0; I < N; ++I) {
69 Arr[I] = 4 + Arr[I];
72 // CHECK-FIXES: for (int & I : Arr)
73 // CHECK-FIXES-NEXT: I = 4 + I;
75 for (int I = 0; I < NMinusOne + 1; ++I) {
76 Sum += Arr[I];
79 // CHECK-FIXES: for (int I : Arr)
80 // CHECK-FIXES-NEXT: Sum += I;
82 for (int I = 0; I < N; ++I) {
83 printf("Fibonacci number %d has address %p\n", Arr[I], &Arr[I]);
84 Sum += Arr[I] + 2;
87 // CHECK-FIXES: for (int & I : Arr)
88 // CHECK-FIXES-NEXT: printf("Fibonacci number %d has address %p\n", I, &I);
89 // CHECK-FIXES-NEXT: Sum += I + 2;
93 for (int I = 0; I < N; ++I) {
94 size += sizeof(Matrix[I]);
95 size += sizeof Matrix[I];
96 size += sizeof((Matrix[I]));
99 // CHECK-FIXES: for (auto & I : Matrix)
100 // CHECK-FIXES-NEXT: size += sizeof(I);
101 // CHECK-FIXES-NEXT: size += sizeof I;
102 // CHECK-FIXES-NEXT: size += sizeof(I);
105 for (int I = 0; I < N; ++I) {
106 Teas[I].g();
112 for (int I = 0; N > I; ++I) {
113 printf("Fibonacci number %d has address %p\n", Arr[I], &Arr[I]);
114 Sum += Arr[I] + 2;
117 // CHECK-FIXES: for (int & I : Arr)
118 // CHECK-FIXES-NEXT: printf("Fibonacci number %d has address %p\n", I, &I);
119 // CHECK-FIXES-NEXT: Sum += I + 2;
121 for (int I = 0; N != I; ++I) {
122 printf("Fibonacci number %d has address %p\n", Arr[I], &Arr[I]);
123 Sum += Arr[I] + 2;
126 // CHECK-FIXES: for (int & I : Arr)
127 // CHECK-FIXES-NEXT: printf("Fibonacci number %d has address %p\n", I, &I);
128 // CHECK-FIXES-NEXT: Sum += I + 2;
130 for (int I = 0; I != N; ++I) {
131 printf("Fibonacci number %d has address %p\n", Arr[I], &Arr[I]);
132 Sum += Arr[I] + 2;
135 // CHECK-FIXES: for (int & I : Arr)
136 // CHECK-FIXES-NEXT: printf("Fibonacci number %d has address %p\n", I, &I);
137 // CHECK-FIXES-NEXT: Sum += I + 2;
141 for (int I = 0; I < N; ++I) {
142 printf("2 * %d = %d\n", ConstArr[I], ConstArr[I] + ConstArr[I]);
145 // CHECK-FIXES: for (int I : ConstArr)
146 // CHECK-FIXES-NEXT: printf("2 * %d = %d\n", I, I + I);
149 for (int I = 0; I < N; ++I) {
150 printf("2 * %d = %d\n", NonCopy[I].X, NonCopy[I].X + NonCopy[I].X);
153 // CHECK-FIXES: for (const auto & I : NonCopy)
154 // CHECK-FIXES-NEXT: printf("2 * %d = %d\n", I.X, I.X + I.X);
157 for (int I = 0; I < N; ++I) {
158 printf("2 * %d = %d\n", Big[I].X, Big[I].X + Big[I].X);
161 // CHECK-FIXES: for (const auto & I : Big)
162 // CHECK-FIXES-NEXT: printf("2 * %d = %d\n", I.X, I.X + I.X);
165 for (int I = 0; I < N; ++I) {
167 return &ConstArr[I];
170 // CHECK-FIXES: for (const int & I : ConstArr)
172 // CHECK-FIXES-NEXT: return &I;
179 for (int I = 0; I < N; ++I) {
180 printf("%d", Arr[I]);
183 // CHECK-FIXES: for (int I : Arr)
184 // CHECK-FIXES-NEXT: printf("%d", I);
186 for (int I = 0; I < N; ++I) {
187 printf("%d", ValArr[I].X);
190 // CHECK-FIXES: for (auto & I : ValArr)
191 // CHECK-FIXES-NEXT: printf("%d", I.X);
195 for (int I = 0; I < N; ++I) {
196 printf("%d", this->Arr[I]);
199 // CHECK-FIXES: for (int I : this->Arr)
200 // CHECK-FIXES-NEXT: printf("%d", I);
202 for (int I = 0; I < N; ++I) {
203 printf("%d", this->ValArr[I].X);
206 // CHECK-FIXES: for (auto & I : this->ValArr)
207 // CHECK-FIXES-NEXT: printf("%d", I.X);
214 for (int I = 0; I < N; ++I) {
215 printf("%d", HA.Arr[I]);
218 // CHECK-FIXES: for (int I : HA.Arr)
219 // CHECK-FIXES-NEXT: printf("%d", I);
221 for (int I = 0; I < N; ++I) {
222 printf("%d", HA.ValArr[I].X);
225 // CHECK-FIXES: for (auto & I : HA.ValArr)
226 // CHECK-FIXES-NEXT: printf("%d", I.X);
230 for (int I = 0; I < N; ++I) {
231 printf("%d", this->HA.Arr[I]);
234 // CHECK-FIXES: for (int I : this->HA.Arr)
235 // CHECK-FIXES-NEXT: printf("%d", I);
237 for (int I = 0; I < N; ++I) {
238 printf("%d", this->HA.ValArr[I].X);
241 // CHECK-FIXES: for (auto & I : this->HA.ValArr)
242 // CHECK-FIXES-NEXT: printf("%d", I.X);
249 for (int I = 0; I < N; ++I)
250 Arr[I] = 0;
257 for (int I = 0; I < N; ++I)
258 (V.*mfpArr[I])();
260 // CHECK-FIXES: for (auto & I : mfpArr)
261 // CHECK-FIXES-NEXT: (V.*I)();
267 for (int I = 0; I < N; ++I)
268 int R = (V.*(Foo[I].f))();
270 // CHECK-FIXES: for (auto & I : Foo)
271 // CHECK-FIXES-NEXT: int R = (V.*(I.f))();
283 printf("I found %d\n", *It);
287 // CHECK-FIXES-NEXT: printf("I found %d\n", It);
293 printf("I found %d\n", *It);
297 // CHECK-FIXES-NEXT: printf("I found %d\n", It);
301 printf("I found %d\n", *It);
305 // CHECK-FIXES-NEXT: printf("I found %d\n", It);
378 for (U::iterator I = Uu.begin(), E = Uu.end(); I != E; ++I)
379 int K = A->X + I->X;
381 // CHECK-FIXES: for (auto & I : Uu)
382 // CHECK-FIXES-NEXT: int K = A->X + I.X;
413 for (PtrSet<int *>::iterator I = Val_int_ptrs.begin(),
415 I != E; ++I) {
416 (void) *I;
427 for (TypedefDerefContainer<int>::iterator I = Int_ptrs.begin(),
429 I != E; ++I) {
430 (void) *I;
440 for (RValueDerefContainer<int>::iterator I = Container.begin(),
442 I != E; ++I) {
443 (void) *I;
448 for (dependent<Val *>::iterator I = Dpp.begin(), E = Dpp.end(); I != E; ++I) {
449 printf("%d\n", (**I).X);
452 // CHECK-FIXES: for (auto & I : Dpp)
453 // CHECK-FIXES-NEXT: printf("%d\n", (*I).X);
455 for (dependent<Val *>::iterator I = Dpp.begin(), E = Dpp.end(); I != E; ++I) {
456 printf("%d\n", (*I)->X);
459 // CHECK-FIXES: for (auto & I : Dpp)
460 // CHECK-FIXES-NEXT: printf("%d\n", I->X);
554 for (iterator I = begin(), E = end(); I != E; ++I)
555 (void) *I;
557 // CHECK-FIXES: for (auto & I : *this)
559 for (iterator I = C::begin(), E = C::end(); I != E; ++I)
560 (void) *I;
562 // CHECK-FIXES: for (auto & I : *this)
564 for (iterator I = begin(), E = end(); I != E; ++I) {
565 (void) *I;
569 for (iterator I = begin(); I != end(); ++I)
570 (void) *I;
572 // CHECK-FIXES: for (auto & I : *this)
574 for (iterator I = begin(); I != end(); ++I) {
575 (void) *I;
581 for (const_iterator I = begin(), E = end(); I != E; ++I)
582 (void) *I;
584 // CHECK-FIXES: for (auto I : *this)
586 for (const_iterator I = C::begin(), E = C::end(); I != E; ++I)
587 (void) *I;
589 // CHECK-FIXES: for (auto I : *this)
591 for (const_iterator I = begin(), E = end(); I != E; ++I) {
592 (void) *I;
608 for (iterator I = begin(), E = end(); I != E; ++I)
609 (void) *I;
611 // CHECK-FIXES: for (auto & I : *this)
630 for (int I = 0, E = V.size(); I < E; ++I) {
631 printf("Fibonacci number is %d\n", V[I]);
632 Sum += V[I] + 2;
635 // CHECK-FIXES: for (int I : V)
636 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", I);
637 // CHECK-FIXES-NEXT: Sum += I + 2;
639 for (int I = 0, E = V.size(); I < E; ++I) {
640 printf("Fibonacci number is %d\n", V.at(I));
641 Sum += V.at(I) + 2;
644 // CHECK-FIXES: for (int I : V)
645 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", I);
646 // CHECK-FIXES-NEXT: Sum += I + 2;
648 for (int I = 0, E = Pv->size(); I < E; ++I) {
649 printf("Fibonacci number is %d\n", Pv->at(I));
650 Sum += Pv->at(I) + 2;
653 // CHECK-FIXES: for (int I : *Pv)
654 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", I);
655 // CHECK-FIXES-NEXT: Sum += I + 2;
661 for (int I = 0; I < Pv->size(); ++I) {
662 printf("Fibonacci number is %d\n", (*Pv).at(I));
663 Sum += (*Pv)[I] + 2;
666 // CHECK-FIXES: for (int I : *Pv)
667 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", I);
668 // CHECK-FIXES-NEXT: Sum += I + 2;
670 for (int I = 0; I < Cv->size(); ++I) {
671 printf("Fibonacci number is %d\n", Cv->at(I));
672 Sum += Cv->at(I) + 2;
675 // CHECK-FIXES: for (int I : *Cv)
676 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", I);
677 // CHECK-FIXES-NEXT: Sum += I + 2;
679 for (int I = 0, E = V.size(); E > I; ++I) {
680 printf("Fibonacci number is %d\n", V[I]);
681 Sum += V[I] + 2;
684 // CHECK-FIXES: for (int I : V)
685 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", I);
686 // CHECK-FIXES-NEXT: Sum += I + 2;
688 for (int I = 0, E = V.size(); I != E; ++I) {
689 printf("Fibonacci number is %d\n", V[I]);
690 Sum += V[I] + 2;
693 // CHECK-FIXES: for (int I : V)
694 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", I);
695 // CHECK-FIXES-NEXT: Sum += I + 2;
697 for (int I = 0, E = V.size(); E != I; ++I) {
698 printf("Fibonacci number is %d\n", V[I]);
699 Sum += V[I] + 2;
702 // CHECK-FIXES: for (int I : V)
703 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", I);
704 // CHECK-FIXES-NEXT: Sum += I + 2;
706 for (int I = 0, E = VD.size(); E != I; ++I) {
707 printf("Fibonacci number is %d\n", VD[I]);
708 Sum += VD[I] + 2;
711 // CHECK-FIXES: for (int I : VD)
712 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", I);
713 // CHECK-FIXES-NEXT: Sum += I + 2;
715 for (int I = 0, E = size(V); E != I; ++I) {
716 printf("Fibonacci number is %d\n", V[I]);
717 Sum += V[I] + 2;
720 // CHECK-FIXES: for (int I : V)
721 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", I);
722 // CHECK-FIXES-NEXT: Sum += I + 2;
724 for (int I = 0, E = size(V); E != I; ++I) {
725 V[I] = 0;
728 // CHECK-FIXES: for (int & I : V)
729 // CHECK-FIXES-NEXT: I = 0;
731 for (int I = 0, E = std::size(V); E != I; ++I) {
732 V[I] = 0;
735 // CHECK-FIXES: for (int & I : V)
736 // CHECK-FIXES-NEXT: I = 0;
739 for (int I = 0, E = length(V); E != I; ++I) {
740 printf("Fibonacci number is %d\n", V[I]);
741 Sum += V[I] + 2;
745 for (int I = 0, E = size(Vals); E != I; ++I) {
746 Sum += Vals[I].X;
756 for (int I = 0, E = Constv.size(); I < E; ++I) {
757 printf("Fibonacci number is %d\n", Constv[I].X);
758 Sum += Constv[I].X + 2;
761 // CHECK-FIXES: for (const auto & I : Constv)
762 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", I.X);
763 // CHECK-FIXES-NEXT: Sum += I.X + 2;
765 for (int I = 0, E = Constv.size(); I < E; ++I) {
766 printf("Fibonacci number is %d\n", Constv.at(I).X);
767 Sum += Constv.at(I).X + 2;
770 // CHECK-FIXES: for (const auto & I : Constv)
771 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", I.X);
772 // CHECK-FIXES-NEXT: Sum += I.X + 2;
774 for (int I = 0, E = Pconstv->size(); I < E; ++I) {
775 printf("Fibonacci number is %d\n", Pconstv->at(I).X);
776 Sum += Pconstv->at(I).X + 2;
779 // CHECK-FIXES: for (const auto & I : *Pconstv)
780 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", I.X);
781 // CHECK-FIXES-NEXT: Sum += I.X + 2;
787 for (int I = 0; I < Pconstv->size(); ++I) {
788 printf("Fibonacci number is %d\n", (*Pconstv).at(I).X);
789 Sum += (*Pconstv)[I].X + 2;
792 // CHECK-FIXES: for (const auto & I : *Pconstv)
793 // CHECK-FIXES-NEXT: printf("Fibonacci number is %d\n", I.X);
794 // CHECK-FIXES-NEXT: Sum += I.X + 2;
801 for (int I = 0; I < ConstVRef.size(); ++I) {
802 sum += ConstVRef[I];
805 // CHECK-FIXES: for (int I : ConstVRef)
806 // CHECK-FIXES-NEXT: sum += I;
808 for (auto I = ConstVRef.begin(), E = ConstVRef.end(); I != E; ++I) {
809 sum += *I;
812 // CHECK-FIXES: for (int I : ConstVRef)
813 // CHECK-FIXES-NEXT: sum += I;
818 for (auto I = 0; I < V.size(); ++I) {
821 for (auto I = 0; I < V.size(); ++I)
853 for (unsigned I = 0, E = NBE.size(); I < E; ++I)
854 printf("%d\n", NBE[I]);
857 for (unsigned I = 0, E = Const_NCBE.size(); I < E; ++I)
858 printf("%d\n", Const_NCBE[I]);
861 for (unsigned I = 0, E = CBE.size(); I < E; ++I)
862 printf("%d\n", CBE[I]);
864 // CHECK-FIXES: for (unsigned int I : CBE)
865 // CHECK-FIXES-NEXT: printf("%d\n", I);
868 for (unsigned I = 0, E = Const_CBE.size(); I < E; ++I)
869 printf("%d\n", Const_CBE[I]);
871 // CHECK-FIXES: for (unsigned int I : Const_CBE)
872 // CHECK-FIXES-NEXT: printf("%d\n", I);
886 for (unsigned I = 0, E = DBV.size(); I < E; ++I) {
887 printf("%d\n", DBV[I]);
890 // CHECK-FIXES: for (unsigned int I : DBV)
891 // CHECK-FIXES-NEXT: printf("%d\n", I);
893 for (unsigned I = 0, E = DBV.size(); I < E; ++I) {
894 auto f = [DBV, I]() {};
895 printf("%d\n", DBV[I]);
898 // CHECK-FIXES: for (unsigned int I : DBV)
899 // CHECK-FIXES-NEXT: auto f = [DBV, &I]() {};
900 // CHECK-FIXES-NEXT: printf("%d\n", I);
989 for (int I = 0; I < N; ++I) {
990 auto V = [T = Arr[I]]() {};
993 // CHECK-FIXES: for (int I : Arr)
994 // CHECK-FIXES-NEXT: auto V = [T = I]() {};
995 for (int I = 0; I < N; ++I) {
996 auto V = [T = 10 + Arr[I]]() {};
999 // CHECK-FIXES: for (int I : Arr)
1000 // CHECK-FIXES-NEXT: auto V = [T = 10 + I]() {};
1002 for (int I = 0; I < N; ++I) {
1003 auto V = [T = I]() {};
1005 for (int I = 0; I < N; ++I) {
1006 auto V = [T = I + 10]() {};