Update copyright years.

[thirdparty/gcc.git] / libstdc++-v3 / testsuite / 25_algorithms / stable_partition / 1.cc

diff --git a/libstdc++-v3/testsuite/25_algorithms/stable_partition/1.cc b/libstdc++-v3/testsuite/25_algorithms/stable_partition/1.cc
index 281d7d556f1eb7ddd9a98abbc7849a90b24603ea..148ff80e7a1fd8280c3760f1142d77f401f08726 100644 (file)
--- a/libstdc++-v3/testsuite/25_algorithms/stable_partition/1.cc
+++ b/libstdc++-v3/testsuite/25_algorithms/stable_partition/1.cc
@@ -1,4 +1,4 @@
-// Copyright (C) 2001, 2009, 2012 Free Software Foundation, Inc.
+// Copyright (C) 2001-2020 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
@@ -19,14 +19,17 @@
 
 #include <algorithm>
 #include <functional>
+#include <testsuite_new_operators.h>
 #include <testsuite_hooks.h>
-
-bool test __attribute__((unused)) = true;
+#include <testsuite_iterators.h>
 
 const int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17};
 const int B[] = {2, 4, 6, 8, 10, 12, 14, 16, 1, 3, 5, 7, 9, 11, 13, 15, 17};
 const int N = sizeof(A) / sizeof(int);
 
+// Index of the middle element that should be returned by the algo.
+const int M = 8;
+
 struct Pred
 {
     bool
@@ -36,20 +39,41 @@ struct Pred
 
 // 25.2.12 stable_partition()
 void
-test02()
+test01()
 {
-    using std::stable_partition;
+  using std::stable_partition;
+  using __gnu_test::test_container;
+  using __gnu_test::forward_iterator_wrapper;
 
-    int s1[N];
-    std::copy(A, A + N, s1);
+  int s1[N];
+  std::copy(A, A + N, s1);
 
-    stable_partition(s1, s1 + N, Pred());
-    VERIFY(std::equal(s1, s1 + N, B));
+  test_container<int, forward_iterator_wrapper> c(s1, s1+N);
+  forward_iterator_wrapper<int> expected = c.begin();
+  std::advance(expected, M);
+  VERIFY( stable_partition(c.begin(), c.end(), Pred()) == expected);
+  VERIFY( std::equal(s1, s1 + N, B) );
 }
 
 int
 main()
 {
-  test02();
+  test01();
+
+  // stable_partition rely on an internal buffer if possible. Try to limit the
+  // size of this buffer to see if algo is robust.
+
+  // Limit to half of the necessary buffer.
+  __gnu_test::set_new_limit(sizeof(A) / 2);
+  test01();
+
+  // Limit to just 1 element.
+  __gnu_test::set_new_limit(sizeof(int));
+  test01();
+
+  // Limit to 0
+  __gnu_test::set_new_limit(0);
+  test01();
+
   return 0;
 }