Lines Matching +full:- +full:i
1 // RUN: %check_clang_tidy %s modernize-loop-convert %t -- -- -I %S/Inputs/loop-convert
5 // CHECK-FIXES-NOT: for ({{.*[^:]:[^:].*}})
6 // CHECK-MESSAGES-NOT: modernize-loop-convert
9 template <class T> auto begin(T& t) -> decltype(t.begin());
10 template <class T> auto begin(const T& t) -> decltype(t.begin());
11 template <class T> auto end(T& t) -> decltype(t.end());
12 template <class T> auto end(const T& t) -> decltype(t.end());
13 template <class T> auto size(const T& t) -> decltype(t.size());
17 template <class T> static auto begin(T& t) -> decltype(t.begin());
18 template <class T> static auto begin(const T& t) -> decltype(t.begin());
19 template <class T> static auto end(T& t) -> decltype(t.end());
20 template <class T> static auto end(const T& t) -> decltype(t.end());
21 template <class T> static auto size(const T& t) -> decltype(t.size());
33 for (int I = 0; I < N + 1; ++I) in IndexStartAndEnd() local
34 Sum += Arr[I]; in IndexStartAndEnd()
36 for (int I = 0; I < N - 1; ++I) in IndexStartAndEnd() local
37 Sum += Arr[I]; in IndexStartAndEnd()
39 for (int I = 1; I < N; ++I) in IndexStartAndEnd() local
40 Sum += Arr[I]; in IndexStartAndEnd()
42 for (int I = 1; I < N; ++I) in IndexStartAndEnd() local
43 Sum += Arr[I]; in IndexStartAndEnd()
45 for (int I = 0;; ++I) in IndexStartAndEnd() local
46 Sum += (*pArr)[I]; in IndexStartAndEnd()
51 for (int I = 0; I < N; --I) in increment() local
52 Sum += Arr[I]; in increment()
54 for (int I = 0; I < N; I) in increment() local
55 Sum += Arr[I]; in increment()
57 for (int I = 0; I < N;) in increment() local
58 Sum += Arr[I]; in increment()
60 for (int I = 0; I < N; I += 2) in increment() local
66 for (int I = 0; I < N; ++I) in IndexUse() local
67 Arr[I] += 1 + I; in IndexUse()
72 for (int I = 0; I < N; ++I) in noArray() local
73 Sum += I; in noArray()
75 for (int I = 0; I < N; ++I) { in noArray() local
78 for (int I = 0; I < N; ++I) in noArray() local
85 for (int I = 0; BadIndex < N; ++I) in mixedVariables() local
86 Sum += Arr[I]; in mixedVariables()
88 for (int I = 0; I < N; ++BadIndex) in mixedVariables() local
89 Sum += Arr[I]; in mixedVariables()
91 for (int I = 0; BadIndex < N; ++BadIndex) in mixedVariables() local
92 Sum += Arr[I]; in mixedVariables()
94 for (int I = 0; BadIndex < N; ++BadIndex) in mixedVariables() local
102 for (int I = 0; I < N; ++I) in multipleArrays() local
103 Sum += Arr[I] + BadArr[I]; in multipleArrays()
105 for (int I = 0; I < N; ++I) { in multipleArrays() local
106 int K = BadArr[I]; in multipleArrays()
107 Sum += Arr[I] + K; in multipleArrays()
130 for (T::iterator I = Bad.notBegin(), E = Bad.end(); I != E; ++I) in notBeginOrEnd() local
131 int K = *I; in notBeginOrEnd()
133 for (T::iterator I = Bad.begin(), E = Bad.notEnd(); I != E; ++I) in notBeginOrEnd() local
134 int K = *I; in notBeginOrEnd()
136 for (T::iterator I = Bad.begin(0), E = Bad.end(0); I != E; ++I) in notBeginOrEnd() local
137 int K = *I; in notBeginOrEnd()
141 for (T::iterator I = Tt.begin(), E = Tt.end(), F = E; I != E; ++I) in badLoopShapes() local
142 int K = *I; in badLoopShapes()
144 for (T::iterator I = Tt.begin(), E = Tt.end(); I != E;) in badLoopShapes() local
145 int K = *I; in badLoopShapes()
147 for (T::iterator I = Tt.begin(), E = Tt.end();; ++I) in badLoopShapes() local
148 int K = *I; in badLoopShapes()
160 for (T::iterator I = Tt.begin(), E = Tt.end(); Lower < N; ++I) in iteratorArrayMix() local
161 int K = *I; in iteratorArrayMix()
163 for (T::iterator I = Tt.begin(), E = Tt.end(); Lower < N; ++Lower) in iteratorArrayMix() local
164 int K = *I; in iteratorArrayMix()
173 for (T::iterator I = ExtraConstructor(Tt.begin(), 0), E = Tt.end(); in badConstructor() local
174 I != E; ++I) in badConstructor()
175 int K = *I; in badConstructor()
176 for (T::iterator I = ExtraConstructor(Tt.begin()), E = Tt.end(); I != E; ++I) in badConstructor() local
177 int K = *I; in badConstructor()
185 for (S::iterator I = Ss.begin(), E = Ss.end(); I != E; ++I) in iteratorUsed() local
186 foo(I); in iteratorUsed()
188 for (S::iterator I = Ss.begin(), E = Ss.end(); I != E; ++I) in iteratorUsed() local
189 Fo.bar(I); in iteratorUsed()
192 for (S::iterator I = Ss.begin(), E = Ss.end(); I != E; ++I) in iteratorUsed() local
193 Ret = I; in iteratorUsed()
197 for (T::iterator I = Tt.begin(), E = Tt.end(); I != E; ++I) in iteratorMemberUsed() local
198 I.X = *I; in iteratorMemberUsed()
200 for (T::iterator I = Tt.begin(), E = Tt.end(); I != E; ++I) in iteratorMemberUsed() local
201 int K = I.X + *I; in iteratorMemberUsed()
203 for (T::iterator I = Tt.begin(), E = Tt.end(); I != E; ++I) in iteratorMemberUsed() local
204 int K = E.X + *I; in iteratorMemberUsed()
208 for (T::iterator I = Tt.begin(), E = Tt.end(); I != E; ++I) in iteratorMethodCalled() local
209 I.insert(3); in iteratorMethodCalled()
211 for (T::iterator I = Tt.begin(), E = Tt.end(); I != E; ++I) in iteratorMethodCalled() local
212 if (I != I) in iteratorMethodCalled()
217 for (T::iterator I = Tt.begin(), E = Tt.end(); I != E; ++I) in iteratorOperatorCalled() local
218 int K = *(++I); in iteratorOperatorCalled()
220 for (S::iterator I = Ss.begin(), E = Ss.end(); I != E; ++I) in iteratorOperatorCalled() local
221 MutableVal K = *(++I); in iteratorOperatorCalled()
226 for (T::iterator I = Tt.begin(), E = Other.end(); I != E; ++I) in differentContainers() local
227 int K = *I; in differentContainers()
228 for (T::iterator I = begin(Tt), E = end(Other); I != E; ++I) in differentContainers() local
229 int K = *I; in differentContainers()
231 for (T::iterator I = Other.begin(), E = Tt.end(); I != E; ++I) in differentContainers() local
232 int K = *I; in differentContainers()
235 for (S::iterator I = Ss.begin(), E = OtherS.end(); I != E; ++I) in differentContainers() local
236 MutableVal K = *I; in differentContainers()
238 for (S::iterator I = OtherS.begin(), E = Ss.end(); I != E; ++I) in differentContainers() local
239 MutableVal K = *I; in differentContainers()
243 for (T::iterator I = Tt.begin(), E = end(Tt); I != E; ++I) in mixedMemberAndADL() local
244 int K = *I; in mixedMemberAndADL()
245 for (T::iterator I = begin(Tt), E = Tt.end(); I != E; ++I) in mixedMemberAndADL() local
246 int K = *I; in mixedMemberAndADL()
247 for (T::iterator I = std::begin(Tt), E = Tt.end(); I != E; ++I) in mixedMemberAndADL() local
248 int K = *I; in mixedMemberAndADL()
249 for (T::iterator I = std::begin(Tt), E = end(Tt); I != E; ++I) in mixedMemberAndADL() local
250 int K = *I; in mixedMemberAndADL()
254 for (T::iterator I = SomeClass::begin(Tt), E = SomeClass::end(Tt); I != E; ++I) in nonADLOrStdCalls() local
255 int K = *I; in nonADLOrStdCalls()
256 for (T::iterator I = somenamespace::begin(Tt), E = somenamespace::end(Tt); I != E; ++I) in nonADLOrStdCalls() local
257 int K = *I; in nonADLOrStdCalls()
262 for (T::iterator I = Tt.begin(), E = Tt.end(); I != Other; ++I) in wrongIterators() local
263 int K = *I; in wrongIterators()
268 U *operator->();
273 for (EvilArrow::iterator I = A.begin(), E = A->end(); I != E; ++I) in differentMemberAccessTypes() local
274 Val K = *I; in differentMemberAccessTypes()
275 for (EvilArrow::iterator I = A->begin(), E = A.end(); I != E; ++I) in differentMemberAccessTypes() local
276 Val K = *I; in differentMemberAccessTypes()
284 for (T::iterator I = Tt.begin(), E = Tt.end(); I != E; ++I) in iteratorPassedToFunction() local
285 f(I, *I); in iteratorPassedToFunction()
293 for (T::iterator I = Tt.begin(); I != TheEnd; ++I) in iteratorDefinedOutside() local
294 int K = *I; in iteratorDefinedOutside()
313 for (int I = 0; I < V.size() + 1; ++I) in IndexStartAndEnd() local
314 Sum += V[I]; in IndexStartAndEnd()
316 for (int I = 0; I < V.size() - 1; ++I) in IndexStartAndEnd() local
317 Sum += V[I]; in IndexStartAndEnd()
319 for (int I = 1; I < V.size(); ++I) in IndexStartAndEnd() local
320 Sum += V[I]; in IndexStartAndEnd()
322 for (int I = 1; I < V.size(); ++I) in IndexStartAndEnd() local
323 Sum += V[I]; in IndexStartAndEnd()
325 for (int I = 0;; ++I) in IndexStartAndEnd() local
326 Sum += (*Pv)[I]; in IndexStartAndEnd()
331 for (int I = 0; I < V.size(); --I) in increment() local
332 Sum += V[I]; in increment()
334 for (int I = 0; I < V.size(); I) in increment() local
335 Sum += V[I]; in increment()
337 for (int I = 0; I < V.size();) in increment() local
338 Sum += V[I]; in increment()
340 for (int I = 0; I < V.size(); I += 2) in increment() local
346 for (int I = 0; I < V.size(); ++I) in IndexUse() local
347 V[I] += 1 + I; in IndexUse()
353 for (int I = 0; BadIndex < V.size(); ++I) in mixedVariables() local
354 Sum += V[I]; in mixedVariables()
356 for (int I = 0; I < V.size(); ++BadIndex) in mixedVariables() local
357 Sum += V[I]; in mixedVariables()
359 for (int I = 0; BadIndex < V.size(); ++BadIndex) in mixedVariables() local
360 Sum += V[I]; in mixedVariables()
362 for (int I = 0; BadIndex < V.size(); ++BadIndex) in mixedVariables() local
370 for (int I = 0; I < V.size(); ++I) in multipleArrays() local
371 Sum += V[I] + BadArr[I]; in multipleArrays()
373 for (int I = 0; I < V.size(); ++I) in multipleArrays() local
374 Sum += BadArr[I]; in multipleArrays()
376 for (int I = 0; I < V.size(); ++I) { in multipleArrays() local
377 int K = BadArr[I]; in multipleArrays()
381 for (int I = 0; I < V.size(); ++I) { in multipleArrays() local
382 int K = BadArr[I]; in multipleArrays()
383 Sum += V[I] + K; in multipleArrays()
391 for (int I = 0; I < V.size(); ++I) in multipleContainers() local
392 Sum += V[I] + BadArr[I]; in multipleContainers()
394 for (int I = 0; I < V.size(); ++I) in multipleContainers() local
395 Sum += BadArr[I]; in multipleContainers()
397 for (int I = 0; I < V.size(); ++I) { in multipleContainers() local
398 int K = BadArr[I]; in multipleContainers()
402 for (int I = 0; I < V.size(); ++I) { in multipleContainers() local
403 int K = BadArr[I]; in multipleContainers()
404 Sum += V[I] + K; in multipleContainers()
408 // Check to make sure that dereferenced pointers-to-containers behave nicely.
412 for (int I = 0; I < Pv->size(); ++I) in derefContainer() local
413 Sum += (**Pv).at(I); in derefContainer()
415 for (int I = 0; I < Pv->size(); ++I) in derefContainer() local
416 Sum += (**Pv)[I]; in derefContainer()
421 for (int I = 0, E = V.size(); I < Bad; ++I) in wrongEnd() local
422 Sum += V[I]; in wrongEnd()
426 for (int I = 0, E = somenamespace::size(V); E != I; ++I) in nonADLOrStdCalls() local
427 printf("Fibonacci number is %d\n", V[I]); in nonADLOrStdCalls()
428 for (int I = 0, E = SomeClass::size(V); E != I; ++I) in nonADLOrStdCalls() local
429 printf("Fibonacci number is %d\n", V[I]); in nonADLOrStdCalls()
432 // Checks to see that non-const member functions are not called on the container
436 for (int I = 0; I < V.size(); ++I) { in memberFunctionCalled() local
437 Sum += V[I]; in memberFunctionCalled()
441 for (int I = 0; I < V.size(); ++I) { in memberFunctionCalled() local
442 Sum += V[I]; in memberFunctionCalled()
461 for (S::iterator I = Xx.Ss.begin(), E = Xx.Ss.end(); I != E; ++I) { in complexContainer() local
463 MutableVal K = *I; in complexContainer()
466 for (T::iterator I = Xx.Tt.begin(), E = Xx.Tt.end(); I != E; ++I) { in complexContainer() local
468 int K = *I; in complexContainer()
471 for (S::iterator I = Xx.Ss.begin(), E = Xx.Ss.end(); I != E; ++I) { in complexContainer() local
473 MutableVal K = *I; in complexContainer()
476 for (T::iterator I = Xx.Tt.begin(), E = Xx.Tt.end(); I != E; ++I) { in complexContainer() local
478 int K = *I; in complexContainer()
481 for (S::iterator I = Xx.getS().begin(), E = Xx.getS().end(); I != E; ++I) { in complexContainer() local
483 MutableVal K = *I; in complexContainer()
489 for (S::iterator I = Exes[Index].getS().begin(), in complexContainer() local
491 I != E; ++I) { in complexContainer()
493 MutableVal K = *I; in complexContainer()
510 for (int I = 0; I < N; ++I) {} in f() local
511 for (int I = 0; I < N; ++I) in f() local
513 for (int I = 0; I < N; ++I) in f() local
515 for (int I = 0; I < N; ++I) in f() local
518 for (S::iterator I = Ss.begin(), E = Ss.end(); I != E; ++I) {} in f() local
519 for (S::iterator I = Ss.begin(), E = Ss.end(); I != E; ++I) in f() local
521 for (S::iterator I = Ss.begin(), E = Ss.end(); I != E; ++I) in f() local
523 for (S::iterator I = Ss.begin(), E = Ss.end(); I != E; ++I) in f() local
526 for (int I = 0; I < V.size(); ++I) {} in f() local
527 for (int I = 0; I < V.size(); ++I) in f() local
529 for (int I = 0; I < V.size(); ++I) in f() local
531 for (int I = 0; I < V.size(); ++I) in f() local