const_iterator.cc: Tweak, avoid potential undefined behavior.

2013-07-05  Paolo Carlini  <paolo.carlini@oracle.com>

	* testsuite/23_containers/deque/modifiers/insert/const_iterator.cc:
	Tweak, avoid potential undefined behavior.
	* testsuite/23_containers/list/modifiers/insert/const_iterator.cc:
	Likewise.
	* testsuite/23_containers/vector/bool/modifiers/insert/
	const_iterator.cc: Likewise.
	* testsuite/23_containers/vector/modifiers/insert/const_iterator.cc:
	Likewise.

From-SVN: r200703

libstdc++-v3/testsuite/23_containers/deque/modifiers/insert/const_iterator.cc

@@ -22,11 +22,11 @@
 
 void test01()
 {
-  std::deque<int> d1;
+  std::deque<int> d1, d2{5, 6};
   int n = 0;
   std::deque<int>::iterator it = d1.insert(d1.cbegin(), n);
   it = d1.insert(d1.cbegin(), 1);
   it = d1.insert(d1.cbegin(), {2, 3});
   it = d1.insert(d1.cbegin(), 1, 4);
-  it = d1.insert(d1.cbegin(), d1.begin(), d1.end());
+  it = d1.insert(d1.cbegin(), d2.begin(), d2.end());
 }

libstdc++-v3/testsuite/23_containers/list/modifiers/insert/const_iterator.cc

@@ -22,11 +22,11 @@
 
 void test01()
 {
-  std::list<int> l1;
+  std::list<int> l1, l2{5, 6};
   int n = 0;
   std::list<int>::iterator it = l1.insert(l1.cbegin(), n);
   it = l1.insert(l1.cbegin(), 1);
   it = l1.insert(l1.cbegin(), {2, 3});
   it = l1.insert(l1.cbegin(), 1, 4);
-  it = l1.insert(l1.cbegin(), l1.begin(), l1.end());
+  it = l1.insert(l1.cbegin(), l2.begin(), l2.end());
 }

libstdc++-v3/testsuite/23_containers/vector/bool/modifiers/insert/const_iterator.cc

@@ -22,9 +22,9 @@
 
 void test01()
 {
-  std::vector<bool> vb1;
+  std::vector<bool> vb1, vb2{true, false};
   std::vector<bool>::iterator it = vb1.insert(vb1.cbegin(), true);
   it = vb1.insert(vb1.cbegin(), {false, true});
   it = vb1.insert(vb1.cbegin(), 1, false);
-  it = vb1.insert(vb1.cbegin(), vb1.begin(), vb1.end());  
+  it = vb1.insert(vb1.cbegin(), vb2.begin(), vb2.end());  
 }

libstdc++-v3/testsuite/23_containers/vector/modifiers/insert/const_iterator.cc

@@ -22,11 +22,11 @@
 
 void test01()
 {
-  std::vector<int> v1;
+  std::vector<int> v1, v2{5, 6};
   int n = 0;
   std::vector<int>::iterator it = v1.insert(v1.cbegin(), n);
   it = v1.insert(v1.cbegin(), 1);
   it = v1.insert(v1.cbegin(), {2, 3});
   it = v1.insert(v1.cbegin(), 1, 4);
-  it = v1.insert(v1.cbegin(), v1.begin(), v1.end());
+  it = v1.insert(v1.cbegin(), v2.begin(), v2.end());
 }