Commit 82ab4b64 by Paolo Carlini Committed by Paolo Carlini

PR libstdc++/25304, DR 865 [Ready]

2009-12-14  Paolo Carlini  <paolo.carlini@oracle.com>

	PR libstdc++/25304, DR 865 [Ready]
	* include/bits/stl_algobase.h (fill_n): Add comment about DR 865.
	* include/bits/stl_algo.h (generate_n): Likewise.
	* include/bits/algorithmfwd.h: Remove obsolete comment.
	* doc/xml/manual/intro.xml: Add an entry for DR 865.

From-SVN: r155241
parent a5d28a12
2009-12-14 Paolo Carlini <paolo.carlini@oracle.com>
PR libstdc++/25304, DR 865 [Ready]
* include/bits/stl_algobase.h (fill_n): Add comment about DR 865.
* include/bits/stl_algo.h (generate_n): Likewise.
* include/bits/algorithmfwd.h: Remove obsolete comment.
* doc/xml/manual/intro.xml: Add an entry for DR 865.
2009-12-14 Ralf Wildenhues <Ralf.Wildenhues@gmx.de> 2009-12-14 Ralf Wildenhues <Ralf.Wildenhues@gmx.de>
* configure.ac: Remove code to un-precious-ize CC, CXX, * configure.ac: Remove code to un-precious-ize CC, CXX,
......
...@@ -815,6 +815,13 @@ requirements of the license of GCC. ...@@ -815,6 +815,13 @@ requirements of the license of GCC.
</term> </term>
<listitem><para>Update / add the signatures. <listitem><para>Update / add the signatures.
</para></listitem></varlistentry> </para></listitem></varlistentry>
<varlistentry><term><ulink url="../ext/lwg-active.html#865">865</ulink>:
<emphasis>More algorithms that throw away information</emphasis>
</term>
<listitem><para>The traditional HP / SGI return type and value is blessed
by the resolution of the DR.
</para></listitem></varlistentry>
</variablelist> </variablelist>
</sect2> </sect2>
......
...@@ -236,13 +236,6 @@ _GLIBCXX_BEGIN_NAMESPACE(std) ...@@ -236,13 +236,6 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
void void
fill(_FIter, _FIter, const _Tp&); fill(_FIter, _FIter, const _Tp&);
/*
XXX NB: return type different from ISO C++.
template<typename _OIter, typename _Size, typename _Tp>
void
fill_n(_OIter, _Size, const _Tp&);
*/
template<typename _OIter, typename _Size, typename _Tp> template<typename _OIter, typename _Size, typename _Tp>
_OIter _OIter
fill_n(_OIter, _Size, const _Tp&); fill_n(_OIter, _Size, const _Tp&);
...@@ -620,13 +613,6 @@ _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_P) ...@@ -620,13 +613,6 @@ _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_P)
void void
generate(_FIter, _FIter, _Generator); generate(_FIter, _FIter, _Generator);
/*
XXX NB: return type different from ISO C++.
template<typename _OIter, typename _Size, typename _Tp>
void
generate_n(_OIter, _Size, _Generator);
*/
template<typename _OIter, typename _Size, typename _Generator> template<typename _OIter, typename _Size, typename _Generator>
_OIter _OIter
generate_n(_OIter, _Size, _Generator); generate_n(_OIter, _Size, _Generator);
......
...@@ -4921,6 +4921,9 @@ _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_P) ...@@ -4921,6 +4921,9 @@ _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_P)
* *
* Performs the assignment @c *i = @p gen() for each @c i in the range * Performs the assignment @c *i = @p gen() for each @c i in the range
* @p [first,first+n). * @p [first,first+n).
*
* _GLIBCXX_RESOLVE_LIB_DEFECTS
* DR 865. More algorithms that throw away information
*/ */
template<typename _OutputIterator, typename _Size, typename _Generator> template<typename _OutputIterator, typename _Size, typename _Generator>
_OutputIterator _OutputIterator
......
...@@ -781,6 +781,9 @@ _GLIBCXX_BEGIN_NAMESPACE(std) ...@@ -781,6 +781,9 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
* This function fills a range with copies of the same value. For char * This function fills a range with copies of the same value. For char
* types filling contiguous areas of memory, this becomes an inline call * types filling contiguous areas of memory, this becomes an inline call
* to @c memset or @ wmemset. * to @c memset or @ wmemset.
*
* _GLIBCXX_RESOLVE_LIB_DEFECTS
* DR 865. More algorithms that throw away information
*/ */
template<typename _OI, typename _Size, typename _Tp> template<typename _OI, typename _Size, typename _Tp>
inline _OI inline _OI
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment