2008-06-26 Paolo Carlini <paolo.carlini@oracle.com>

	* include/bits/stl_algo.h (partition_copy): Add in C++0x mode.
	* include/bits/algorithmfwd.h: Add.
	* testsuite/25_algorithms/headers/algorithm/synopsis.cc: Update.
	* testsuite/25_algorithms/partition_copy/1.cc: New.
	* testsuite/25_algorithms/partition_copy/check_type.cc: Likewise.
	* testsuite/25_algorithms/partition_copy/requirements/
	explicit_instantiation/2.cc: Likewise.
	* testsuite/25_algorithms/partition_copy/requirements/
	explicit_instantiation/pod.cc: Likewise.


git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@137152 138bc75d-0d04-0410-961f-82ee72b054a4

1 files changed, 41 insertions, 15 deletions

diff --git a/libstdc++-v3/include/bits/algorithmfwd.h b/libstdc++-v3/include/bits/algorithmfwd.h
index 992dc4f5afe..fa4e72cd412 100644
--- a/libstdc++-v3/include/bits/algorithmfwd.h
+++ b/libstdc++-v3/include/bits/algorithmfwd.h
@@ -25,9 +25,12 @@
 
 /*
   adjacent_find
+  all_of (C++0x)
+  any_of (C++0x)
   binary_search
   copy
   copy_backward
+  copy_if (C++0x)
   count
   count_if
   equal
@@ -38,6 +41,7 @@
   find_end
   find_first_of
   find_if
+  find_if_not (C++0x)
   for_each
   generate
   generate_n
@@ -60,10 +64,12 @@
   minmax_element (C++0x)
   mismatch
   next_permutation
+  none_of (C++0x)
   nth_element
   partial_sort
   partial_sort_copy
   partition
+  partition_copy (C++0x)
   pop_heap
   prev_permutation
   push_heap
@@ -111,6 +117,16 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
 
   // adjacent_find
 
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+  template<typename _IIter, typename _Predicate>
+    bool
+    all_of(_IIter, _IIter, _Predicate);
+
+  template<typename _IIter, typename _Predicate>
+    bool
+    any_of(_IIter, _IIter, _Predicate);
+#endif
+
   template<typename _FIter, typename _Tp>
     bool 
     binary_search(_FIter, _FIter, const _Tp&);
@@ -127,6 +143,12 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
     _BIter2
     copy_backward(_BIter1, _BIter1, _BIter2);
 
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+  template<typename _IIter, typename _OIter, typename _Predicate>
+    _OIter
+    copy_if(_IIter, _IIter, _OIter, _Predicate);
+#endif
+
   // count
   // count_if
 
@@ -165,28 +187,17 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
 
   // find_first_of
   // find_if
-  // for_each
-  // generate
-  // generate_n
 
 #ifdef __GXX_EXPERIMENTAL_CXX0X__
   template<typename _IIter, typename _Predicate>
-    bool
-    all_of(_IIter, _IIter, _Predicate);
-
-  template<typename _IIter, typename _Predicate>
-    bool
-    any_of(_IIter, _IIter, _Predicate);
-
-  template<typename _IIter, typename _Predicate>
-    bool
-    none_of(_IIter, _IIter, _Predicate);
-
-  template<typename _IIter, typename _Predicate>
     _IIter
     find_if_not(_IIter, _IIter, _Predicate);
 #endif
 
+  // for_each
+  // generate
+  // generate_n
+
   template<typename _IIter1, typename _IIter2>
     bool 
     includes(_IIter1, _IIter1, _IIter2, _IIter2);
@@ -306,6 +317,12 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
     bool 
     next_permutation(_BIter, _BIter, _Compare);
 
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+  template<typename _IIter, typename _Predicate>
+    bool
+    none_of(_IIter, _IIter, _Predicate);
+#endif
+
   // nth_element
   // partial_sort
 
@@ -317,6 +334,15 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
     _RAIter
     partial_sort_copy(_IIter, _IIter, _RAIter, _RAIter, _Compare);
 
+  // partition
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+  template<typename _IIter, typename _OIter1,
+	   typename _OIter2, typename _Predicate>
+    pair<_OIter1, _OIter2>
+    partition_copy(_IIter, _IIter, _OIter1, _OIter2, _Predicate);
+#endif
+
   template<typename _RAIter>
     void 
     pop_heap(_RAIter, _RAIter);