145
|
1 /* { dg-do compile } */
|
|
2 /* { dg-options "-O2 -fdump-tree-cddce2 -ffinite-loops" } */
|
|
3
|
|
4 #include <string>
|
|
5 #include <vector>
|
|
6 #include <list>
|
|
7 #include <set>
|
|
8 #include <map>
|
|
9
|
|
10 using namespace std;
|
|
11
|
|
12 int foo (vector<string> &v, list<string> &l, set<string> &s, map<int, string> &m)
|
|
13 {
|
|
14 for (vector<string>::iterator it = v.begin (); it != v.end (); ++it)
|
|
15 it->length();
|
|
16
|
|
17 for (list<string>::iterator it = l.begin (); it != l.end (); ++it)
|
|
18 it->length();
|
|
19
|
|
20 for (map<int, string>::iterator it = m.begin (); it != m.end (); ++it)
|
|
21 it->first + it->second.length();
|
|
22
|
|
23 for (set<string>::iterator it0 = s.begin (); it0 != s.end(); ++it0)
|
|
24 for (vector<string>::reverse_iterator it1 = v.rbegin(); it1 != v.rend(); ++it1)
|
|
25 {
|
|
26 it0->length();
|
|
27 it1->length();
|
|
28 }
|
|
29
|
|
30 return 0;
|
|
31 }
|
|
32 /* { dg-final { scan-tree-dump-not "if" "cddce2"} } */
|
|
33
|