obtained gcc-4.6.4.tar.bz2 from upstream website;upstream

verified gcc-4.6.4.tar.bz2.sig;
imported gcc-4.6.4 source tree from verified upstream tarball.

downloading a git-generated archive based on the 'upstream' tag
should provide you with a source tree that is binary identical
to the one extracted from the above tarball.

if you have obtained the source via the command 'git clone',
however, do note that line-endings of files in your working
directory might differ from line-endings of the respective
files in the upstream repository.

4 files changed, 261 insertions, 0 deletions

diff --git a/libstdc++-v3/testsuite/25_algorithms/minmax_element/1.cc b/libstdc++-v3/testsuite/25_algorithms/minmax_element/1.cc
new file mode 100644
index 000000000..65662d03d
--- /dev/null
+++ b/libstdc++-v3/testsuite/25_algorithms/minmax_element/1.cc
@@ -0,0 +1,138 @@
+// { dg-options "-std=gnu++0x" }
+
+// Copyright (C) 2007, 2009 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the
+// terms of the GNU General Public License as published by the
+// Free Software Foundation; either version 3, or (at your option)
+// any later version.
+
+// This library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+// GNU General Public License for more details.
+
+// You should have received a copy of the GNU General Public License along
+// with this library; see the file COPYING3.  If not see
+// <http://www.gnu.org/licenses/>.
+
+#include <algorithm>
+#include <testsuite_iterators.h>
+#include <testsuite_hooks.h>
+
+using __gnu_test::test_container;
+using __gnu_test::forward_iterator_wrapper;
+using std::minmax_element;
+
+typedef test_container<int, forward_iterator_wrapper> Container;
+typedef std::pair<forward_iterator_wrapper<int>, forward_iterator_wrapper<int> > pair_type;
+
+void
+test1()
+{
+  bool test __attribute__((unused)) = true;
+  
+  int array[] = {0};
+  Container con(array, array);
+  pair_type p1 = minmax_element(con.begin(), con.end());
+  VERIFY( p1.first.ptr == array );
+  VERIFY( p1.second.ptr == array );
+}
+
+void
+test2()
+{
+  bool test __attribute__((unused)) = true;
+
+  int array[] = {0};
+  Container con(array, array + 1);
+  pair_type p1 = minmax_element(con.begin(), con.end());
+  VERIFY( p1.first.ptr == array );
+  VERIFY( p1.second.ptr == array );
+}
+
+void
+test3()
+{
+  bool test __attribute__((unused)) = true;
+  
+  int array[] = {0, 3};
+  Container con(array, array + 2);
+  pair_type p1 = minmax_element(con.begin(), con.end());
+  VERIFY( p1.first.ptr == array );
+  VERIFY( p1.second.ptr == array + 1 );
+}
+
+void
+test4()
+{
+  bool test __attribute__((unused)) = true;
+  
+  int array[] = {3, 0};
+  Container con(array, array + 2);
+  pair_type p1 = minmax_element(con.begin(), con.end());
+  VERIFY( p1.first.ptr == array + 1 );
+  VERIFY( p1.second.ptr == array );
+}
+
+void
+test5()
+{
+  bool test __attribute__((unused)) = true;
+
+  int array[] = {3, 3};
+  Container con(array, array + 2);
+  pair_type p1 = minmax_element(con.begin(), con.end());
+  VERIFY( p1.first.ptr == array );
+  VERIFY( p1.second.ptr == array + 1 );
+}
+
+void
+test6()
+{
+  bool test __attribute__((unused)) = true;
+
+  int array[] = {6, 3, 0, 2, 6, 4, 0};
+  Container con(array, array + 7);
+  pair_type p1 = minmax_element(con.begin(), con.end());
+  VERIFY( p1.first.ptr == array + 2 );
+  VERIFY( p1.second.ptr == array + 4 );
+}
+
+void
+test7()
+{
+  bool test __attribute__((unused)) = true;
+
+  int array[] = {4, 4, 4, 6, 6, 6, 1, 1, 0, 0, 0, 2, 2};
+  Container con(array, array + 13);
+  pair_type p1 = minmax_element(con.begin(), con.end());
+  VERIFY( p1.first.ptr == array + 8 );
+  VERIFY( p1.second.ptr == array + 5 );
+}
+
+void
+test8()
+{
+  bool test __attribute__((unused)) = true;
+
+  int array[] = {1, 7, 5, 5, 10, 1, 0, 0, 8, 4, 4, 0, 10, 10, 10, 1};
+  Container con(array, array + 16);
+  pair_type p1 = minmax_element(con.begin(), con.end());
+  VERIFY( p1.first.ptr == array + 6 );
+  VERIFY( p1.second.ptr == array + 14 );
+}
+
+int main()
+{
+  test1();
+  test2();
+  test3();
+  test4();
+  test5();
+  test6();
+  test7();
+  test8();
+  return 0;
+}
diff --git a/libstdc++-v3/testsuite/25_algorithms/minmax_element/check_type.cc b/libstdc++-v3/testsuite/25_algorithms/minmax_element/check_type.cc
new file mode 100644
index 000000000..3cd46259c
--- /dev/null
+++ b/libstdc++-v3/testsuite/25_algorithms/minmax_element/check_type.cc
@@ -0,0 +1,43 @@
+// { dg-options "-std=gnu++0x" }
+
+// Copyright (C) 2007, 2009 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the
+// terms of the GNU General Public License as published by the
+// Free Software Foundation; either version 3, or (at your option)
+// any later version.
+
+// This library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+// GNU General Public License for more details.
+
+// You should have received a copy of the GNU General Public License along
+// with this library; see the file COPYING3.  If not see
+// <http://www.gnu.org/licenses/>.
+
+// { dg-do compile }
+
+#include <algorithm>
+#include <testsuite_iterators.h>
+
+using __gnu_test::forward_iterator_wrapper;
+
+struct S { };
+
+bool 
+operator<(const S&, const S&) {return true;}
+
+struct X { };
+
+bool 
+predicate(const X&, const X&) {return true;}
+
+std::pair<forward_iterator_wrapper<S>, forward_iterator_wrapper<S> >
+test1(forward_iterator_wrapper<S>& s)
+{ return std::minmax_element(s,s); }
+
+std::pair<forward_iterator_wrapper<X>, forward_iterator_wrapper<X> >
+test2(forward_iterator_wrapper<X>& x)
+{ return std::minmax_element(x,x,predicate); }
diff --git a/libstdc++-v3/testsuite/25_algorithms/minmax_element/requirements/explicit_instantiation/2.cc b/libstdc++-v3/testsuite/25_algorithms/minmax_element/requirements/explicit_instantiation/2.cc
new file mode 100644
index 000000000..5e03b5e39
--- /dev/null
+++ b/libstdc++-v3/testsuite/25_algorithms/minmax_element/requirements/explicit_instantiation/2.cc
@@ -0,0 +1,40 @@
+// { dg-do compile }
+// { dg-options "-std=gnu++0x" }
+
+// 2007-11-01  Paolo Carlini  <pcarlini@suse.de>
+
+// Copyright (C) 2007, 2009 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the
+// terms of the GNU General Public License as published by the
+// Free Software Foundation; either version 3, or (at your option)
+// any later version.
+
+// This library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+// GNU General Public License for more details.
+
+// You should have received a copy of the GNU General Public License along
+// with this library; see the file COPYING3.  If not see
+// <http://www.gnu.org/licenses/>.
+
+
+#include <algorithm>
+#include <functional>
+#include <testsuite_api.h>
+
+namespace std
+{
+  using __gnu_test::NonDefaultConstructible;
+
+  typedef NonDefaultConstructible 		value_type;
+  typedef value_type* 		iterator_type;
+  typedef std::less<value_type> compare_type;
+
+  template pair<iterator_type, iterator_type>
+    minmax_element(iterator_type, iterator_type);
+  template pair<iterator_type, iterator_type>
+    minmax_element(iterator_type, iterator_type, compare_type);
+}
diff --git a/libstdc++-v3/testsuite/25_algorithms/minmax_element/requirements/explicit_instantiation/pod.cc b/libstdc++-v3/testsuite/25_algorithms/minmax_element/requirements/explicit_instantiation/pod.cc
new file mode 100644
index 000000000..17a1e85b5
--- /dev/null
+++ b/libstdc++-v3/testsuite/25_algorithms/minmax_element/requirements/explicit_instantiation/pod.cc
@@ -0,0 +1,40 @@
+// { dg-do compile }
+// { dg-options "-std=gnu++0x" }
+
+// 2007-11-01  Paolo Carlini  <pcarlini@suse.de>
+
+// Copyright (C) 2007, 2009 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the
+// terms of the GNU General Public License as published by the
+// Free Software Foundation; either version 3, or (at your option)
+// any later version.
+
+// This library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+// GNU General Public License for more details.
+
+// You should have received a copy of the GNU General Public License along
+// with this library; see the file COPYING3.  If not see
+// <http://www.gnu.org/licenses/>.
+
+
+#include <algorithm>
+#include <testsuite_character.h>
+
+namespace std
+{
+  using __gnu_test::pod_int;
+
+  typedef pod_int 		value_type;
+  typedef value_type* 		iterator_type;
+  typedef std::less<value_type> compare_type;
+
+  template pair<iterator_type, iterator_type>
+    minmax_element(iterator_type, iterator_type);
+  template pair<iterator_type, iterator_type>
+    minmax_element(iterator_type, iterator_type, compare_type);
+}
+