209   for (S::const_iterator It = S_const.begin(); It != S_const.end(); ++It) {  in refs_and_vals()  local
210     MutableVal Alias = *It;  in refs_and_vals()
220   for (S::iterator It = Ss.begin(), E = Ss.end(); It != E; ++It) {  in refs_and_vals()  local
221     MutableVal Alias = *It;  in refs_and_vals()
231   for (S::iterator It = Ss.begin(), E = Ss.end(); It != E; ++It) {  in refs_and_vals()  local
232     MutableVal &Alias = *It;  in refs_and_vals()
243   for (dependent<int>::iterator It = Dep.begin(), E = Dep.end(); It != E; ++It) {  in refs_and_vals()  local
244     printf("%d\n", *It);  in refs_and_vals()
374   for (S::iterator It = MAXs.begin(), E = MAXs.end(); It != E; ++It) {  in macroConflict()  local
375     printf("s has value %d\n", (*It).X);  in macroConflict()
383   for (S::const_iterator It = MAXs.begin(), E = MAXs.end(); It != E; ++It) {  in macroConflict()  local
384     printf("s has value %d\n", (*It).X);  in macroConflict()
393   for (T::iterator It = DEFs.begin(), E = DEFs.end(); It != E; ++It) {  in macroConflict()  local
394     if (*It == DEF) {  in macroConflict()
395       printf("I found %d\n", *It);  in macroConflict()
406   for (T::iterator It = ints.begin(), E = ints.end(); It != E; ++It) {  in keywordConflict()  local
407     *It = 5;  in keywordConflict()
414   for (U::iterator It = __FUNCTION__s.begin(), E = __FUNCTION__s.end();  in keywordConflict()  local
415        It != E; ++It) {  in keywordConflict()
416     int __FUNCTION__s_It = (*It).X + 2;  in keywordConflict()
427   for (T::iterator It = Vals.begin(), E = Vals.end(); It != E; ++It)  in typeConflict()  local
428     (void) *It;  in typeConflict()
434   for (T::iterator It = Vals.begin(), E = Vals.end(); It != E; ++It) {  in typeConflict()  local
435     *It = sizeof(Val);  in typeConflict()
445   for (U::iterator It = TDs.begin(), E = TDs.end(); It != E; ++It)  in typeConflict()  local
446     (void) *It;  in typeConflict()
451   for (U::iterator It = TDs.begin(), E = TDs.end(); It != E; ++It) {  in typeConflict()  local
454     (void) *It;  in typeConflict()
463   for (T::iterator It = Sts.begin(), E = Sts.end(); It != E; ++It) {  in typeConflict()  local
464     *It = sizeof(St);  in typeConflict()
509 void g(S::iterator It);
510 void const_g(S::const_iterator It);
513   void g(S::iterator It);
514   void const_g(S::const_iterator It);
649   for (T::iterator It = Tt.begin(); It != Tt.end(); ++It) {  in f()  local
650     printf("I found %d\n", *It);  in f()
657   for (T::iterator It = Pt->begin(); It != Pt->end(); ++It) {  in f()  local
658     printf("I found %d\n", *It);  in f()
665   for (S::iterator It = Ss.begin(); It != Ss.end(); ++It) {  in f()  local
666     printf("s has value %d\n", (*It).X);  in f()
673   for (S::iterator It = Ps->begin(); It != Ps->end(); ++It) {  in f()  local
674     printf("s has value %d\n", (*It).X);  in f()
680   for (S::iterator It = Ss.begin(); It != Ss.end(); ++It) {  in f()  local
681     printf("s has value %d\n", It->X);  in f()
687   for (S::iterator It = Ss.begin(); It != Ss.end(); ++It) {  in f()  local
688     It->X = 3;  in f()
694   for (S::iterator It = Ss.begin(); It != Ss.end(); ++It) {  in f()  local
695     (*It).X = 3;  in f()
701   for (S::iterator It = Ss.begin(); It != Ss.end(); ++It) {  in f()  local
702     It->nonConstFun(4, 5);  in f()
709   for (U::iterator It = Uu.begin(); It != Uu.end(); ++It) {  in f()  local
710     printf("s has value %d\n", It->X);  in f()
716   for (U::iterator It = Uu.begin(); It != Uu.end(); ++It) {  in f()  local
717     printf("s has value %d\n", (*It).X);  in f()
731   for (dependent<int>::iterator It = V.begin();  in f()  local
732        It != V.end(); ++It) {  in f()
733     printf("Fibonacci number is %d\n", *It);  in f()
739   for (dependent<int>::iterator It(V.begin());  in f()  local
740        It != V.end(); ++It) {  in f()
741     printf("Fibonacci number is %d\n", *It);  in f()
748   for (doublyDependent<int, int>::iterator It = intmap.begin();  in f()  local
749        It != intmap.end(); ++It) {  in f()
750     printf("intmap[%d] = %d", It->first, It->second);  in f()
764   for (S::const_iterator It = Ss.begin(); It != Ss.end(); ++It) {  in different_type()  local
765     printf("s has value %d\n", (*It).X);  in different_type()
772   for (S::const_iterator It = Ps->begin(); It != Ps->end(); ++It) {  in different_type()  local
773     printf("s has value %d\n", (*It).X);  in different_type()
780   for (dependent<int>::const_iterator It = V.begin(); It != V.end(); ++It) {  in different_type()  local
781     printf("Fibonacci number is %d\n", *It);  in different_type()
787   for (dependent<int>::const_iterator It(V.begin()); It != V.end(); ++It) {  in different_type()  local
788     printf("Fibonacci number is %d\n", *It);  in different_type()