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.

1 files changed, 83 insertions, 0 deletions

diff --git a/libstdc++-v3/testsuite/23_containers/forward_list/operations/6.cc b/libstdc++-v3/testsuite/23_containers/forward_list/operations/6.cc
new file mode 100644
index 000000000..082d2adbb
--- /dev/null
+++ b/libstdc++-v3/testsuite/23_containers/forward_list/operations/6.cc
@@ -0,0 +1,83 @@
+// { dg-options "-std=gnu++0x" }
+
+// Copyright (C) 2008, 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/>.
+
+// 23.2.3.n forward_list xxx [lib.forward_list.xxx]
+
+#include <forward_list>
+#include <testsuite_hooks.h>
+
+bool test __attribute__((unused)) = true;
+
+//  Comparison functor.
+template<typename Num>
+  class Comp
+  {
+  public:
+    Comp(const Num & num)
+      {
+        n = num;
+      }
+    bool operator()(const Num i, const Num j)
+      {
+        return (n * i) < (n * j);
+      }
+  private:
+    Num n;
+  };
+
+// This test verifies the following:
+//   
+void
+test01()
+{
+  const unsigned int n = 13;
+  int order[][n] = {
+    { 0,1,2,3,4,5,6,7,8,9,10,11,12 },
+    { 6,2,8,4,11,1,12,7,3,9,5,0,10 },
+    { 12,11,10,9,8,7,6,5,4,3,2,1,0 },
+  };
+  std::forward_list<int> sorted(order[0], order[0] + n);
+
+  for (unsigned int i = 0; i < sizeof(order)/sizeof(*order); ++i)
+    {
+      std::forward_list<int> head(order[i], order[i] + n);
+
+      head.sort();
+
+      VERIFY(head == sorted);
+    }
+
+  std::forward_list<int> reversed(order[2], order[2] + n);
+  for (unsigned int i = 0; i < sizeof(order)/sizeof(*order); ++i)
+    {
+      std::forward_list<int> head(order[i], order[i] + n);
+
+      Comp<int> comp(-1);
+      head.sort( comp );
+
+      VERIFY(head == reversed);
+    }
+}
+
+int
+main()
+{
+  test01();
+  return 0;
+}