BUGS: Update from 2.90.8 snapshot.

2003-06-10  Phil Edwards  <pme@gcc.gnu.org>

	* docs/html/17_intro/BUGS:  Update from 2.90.8 snapshot.
	* docs/html/17_intro/CHECKLIST:  Bring up to date with respect to
	correctness of container::iterator typedefs.  Fix whitespace.
	* docs/html/20_util/howto.html, docs/html/ext/howto.html:  Add links
	to allocator docs.
	* docs/html/documentation.html:  Regenerate.

	* include/bits/basic_string.h, include/bits/basic_string.tcc,
	include/bits/deque.tcc, include/bits/list.tcc, include/bits/stl_algo.h,
	include/bits/stl_algobase.h, include/bits/stl_bvector.h,
	include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
	include/bits/stl_list.h, include/bits/stl_uninitialized.h,
	include/bits/stl_vector.h, include/bits/vector.tcc,
	include/ext/algorithm, include/ext/slist, include/std/std_bitset.h:
	Change _Iter names to _Iterator, and __pos to __position.

	* include/bits/stl_relops.h, include/bits/stl_numeric.h,
	include/bits/stl_multiset.h, include/bits/stl_set.h:
	Remove emacs markers.

	* include/bits/stl_threads.h (_STL_auto_lock):  Add __unused__.

From-SVN: r67736

5 files changed, 67 insertions, 68 deletions

diff --git a/libstdc++-v3/docs/html/17_intro/BUGS b/libstdc++-v3/docs/html/17_intro/BUGS
index 04e4bc8..e71304d 100644
--- a/libstdc++-v3/docs/html/17_intro/BUGS
+++ b/libstdc++-v3/docs/html/17_intro/BUGS
@@ -1,7 +1,4 @@
-2000-03-24 libstdc++2.90.8
-
-- testsuite/27_io/istream_extractors_char.cc: 
-  Failing on all platforms with -O2, working with -O. Need to look at this.
+2003-04-26
 
 - _GLIBCPP_HAS_BUILTIN_SINF: We should still hold out for a cleaner solution the is currenly the case in bits/std_cmath.h. 
 
diff --git a/libstdc++-v3/docs/html/17_intro/CHECKLIST b/libstdc++-v3/docs/html/17_intro/CHECKLIST
index 9d3f80d..ad02b0d 100644
--- a/libstdc++-v3/docs/html/17_intro/CHECKLIST
+++ b/libstdc++-v3/docs/html/17_intro/CHECKLIST
@@ -1,6 +1,6 @@
 
    Completion Checklist for the Standard C++ Library
-   Updated: 1999-05-18
+   Updated: 2003-04-25
 
    Status Code Legend:
     M - Missing
@@ -17,10 +17,8 @@
    issues appear [in brackets].
 
    Note that this checklist does not (yet) include all emendations
-   recommended by the ISO Library Working Group:  (restricted site)
-     http://www.cygnus.com/iso/wp/html/fdis/lwg-issues.html
-   The LWG has announced its intention to release a public version
-   of the issues list, URL to be added here.   XXX
+   recommended by the ISO Library Working Group:
+   http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-toc.html
 
    Detailed explanation of status codes:
 
@@ -36,7 +34,7 @@
         It may have an incorrect base class, wrong namespace, wrong
         storage class, or simply not fully implement requirements.
         However, it may be sufficiently usable to help test other
-	components.
+        components.
 
     T - Implemented, pending test/inspection:  Implementation believed
         to be complete, and informal testing suggests it is ready for
@@ -49,14 +47,14 @@
         Inspected, "implementation-defined" documentation accepted,
         local usability criteria satisfied, formally inspected for
         other untestable conformance.  (Untestable requirements
-	include exception-safety, thread-safety, worst-case
-	complexity, memory cleanliness, usefulness.)
+        include exception-safety, thread-safety, worst-case
+        complexity, memory cleanliness, usefulness.)
 
     P - Portability verified:  Qualified on all primary target platforms.
 
     C - Certified:  Formally certified to have passed all tests,
         inspections, qualifications; approved under "signing authority"
-	to be used to satisfy contractual guarantees.
+        to be used to satisfy contractual guarantees.
 
    ----------------------------------------------------------------------
        <algorithm>    <iomanip>    <list>      <ostream>     <streambuf>
@@ -89,11 +87,11 @@ X   wctrans_t, wctype_t, and wint_t.
     subroutines is implementation-defined.
 
    18.1  Types                                        [lib.support.types]
-X	<cstddef>
-X	NULL
-X  	offsetof
-X	ptrdiff_t
-X	size_t
+X      <cstddef>
+X      NULL
+X      offsetof
+X      ptrdiff_t
+X      size_t
 
    18.2  Implementation properties                   [lib.support.limits]
 
@@ -101,9 +99,6 @@ X	size_t
 
    18.2.1  Numeric limits                                    [lib.limits]
 
-   [Note: the numeric_limits templates are now automatically
-    generated. ]
-
 X   template<class T> class numeric_limits;
 
 T   enum float_round_style;
@@ -192,7 +187,7 @@ T     denorm present = 1;
 
    1 Header <climits> (Table 3):
       CHAR_BIT   INT_MAX    LONG_MIN     SCHAR_MIN   UCHAR_MAX   USHRT_MAX
-X  	  CHAR_MAX   INT_MIN    MB_LEN_MAX   SHRT_MAX    UINT_MAX
+X     CHAR_MAX   INT_MIN    MB_LEN_MAX   SHRT_MAX    UINT_MAX
       CHAR_MIN   LONG_MAX   SCHAR_MAX    SHRT_MIN    ULONG_MAX
 
    3 Header <cfloat> (Table 4):
@@ -457,7 +452,7 @@ X                    |Macros:   EDOM   ERANGE   errno |
    Header <utility> synopsis
 
     // _lib.operators_, operators:
-X    namespace rel_ops {
+T    namespace rel_ops {
 T      template<class T> bool operator!=(const T&, const T&);
 T      template<class T> bool operator> (const T&, const T&);
 T      template<class T> bool operator<=(const T&, const T&);
@@ -2280,7 +2275,7 @@ X           Functions:   localeconv    setlocale
 
    Header <deque> synopsis
 
-X   template <class T, class Allocator = allocator<T> > class deque;
+T   template <class T, class Allocator = allocator<T> > class deque;
 T   template <class T, class Allocator>
       bool operator==(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
 T   template <class T, class Allocator>
@@ -2299,7 +2294,7 @@ T   template <class T, class Allocator>
 
    Header <list> synopsis
 
-X   template <class T, class Allocator = allocator<T> > class list;
+T   template <class T, class Allocator = allocator<T> > class list;
 T   template <class T, class Allocator>
       bool operator==(const list<T,Allocator>& x, const list<T,Allocator>& y);
 T   template <class T, class Allocator>
@@ -2319,7 +2314,7 @@ T   template <class T, class Allocator>
    Header <queue> synopsis
 
    namespace std {
-X   template <class T, class Container = deque<T> > class queue;
+T   template <class T, class Container = deque<T> > class queue;
 T   template <class T, class Container>
       bool operator==(const queue<T, Container>& x,
                       const queue<T, Container>& y);
@@ -2418,13 +2413,13 @@ T   template <class Allocator>
    23.2.1  Template class deque                               [lib.deque]
 
     template <class T, class Allocator = allocator<T> >
-X   class deque {
+T   class deque {
     public:
       // types:
 T     typedef typename Allocator::reference         reference;
 T     typedef typename Allocator::const_reference   const_reference;
-X     typedef implementation defined                iterator;
-X     typedef implementation defined                const_iterator;
+T     typedef implementation defined                iterator;
+T     typedef implementation defined                const_iterator;
 T     typedef implementation defined                size_type;
 T     typedef implementation defined                difference_type;
 T     typedef T                                     value_type;
@@ -2511,14 +2506,14 @@ T   template <class T, class Allocator>
 
    23.2.2  Template class list                                 [lib.list]
 
-X   template <class T, class Allocator = allocator<T> >
+T   template <class T, class Allocator = allocator<T> >
     class list {
     public:
       // types:
 T     typedef typename Allocator::reference         reference;
 T     typedef typename Allocator::const_reference   const_reference;
-X     typedef implementation defined                iterator;
-X     typedef implementation defined                const_iterator;
+T     typedef implementation defined                iterator;
+T     typedef implementation defined                const_iterator;
 T     typedef implementation defined                size_type;
 T     typedef implementation defined                difference_type;
 T     typedef T                                     value_type;
@@ -2720,13 +2715,13 @@ T   template <class T, class Container>
    23.2.4  Template class vector                             [lib.vector]
 
     template <class T, class Allocator = allocator<T> >
-X   class vector {
+T   class vector {
     public:
       // types:
 T     typedef typename Allocator::reference         reference;
 T     typedef typename Allocator::const_reference   const_reference;
-X     typedef implementation defined                iterator;
-X     typedef implementation defined                const_iterator;
+T     typedef implementation defined                iterator;
+T     typedef implementation defined                const_iterator;
 T     typedef implementation defined                size_type;
 T     typedef implementation defined                difference_type;
 T     typedef T                                     value_type;
@@ -2814,12 +2809,12 @@ T   template <class T, class Allocator>
 
    23.2.5  Class vector<bool>                           [lib.vector.bool]
 
-X   template <class Allocator> class vector<bool, Allocator> {
+T   template <class Allocator> class vector<bool, Allocator> {
     public:
       // types:
 T     typedef bool                                  const_reference;
-X     typedef implementation defined                iterator;
-X     typedef implementation defined                const_iterator;
+T     typedef implementation defined                iterator;
+T     typedef implementation defined                const_iterator;
 T     typedef implementation defined                size_type;
 T     typedef implementation defined                difference_type;
 T     typedef bool                                  value_type;
@@ -2925,7 +2920,7 @@ T   template <class Allocator>
 
     template <class Key, class T, class Compare = less<Key>,
               class Allocator = allocator<pair<const Key, T> > >
-X     class map;
+T     class map;
 
 T   template <class Key, class T, class Compare, class Allocator>
       bool operator==(const map<Key,T,Compare,Allocator>& x,
@@ -2978,7 +2973,7 @@ T   template <class Key, class T, class Compare, class Allocator>
 
     template <class Key, class Compare = less<Key>,
               class Allocator = allocator<Key> >
-X     class set;
+T     class set;
 
 T   template <class Key, class Compare, class Allocator>
       bool operator==(const set<Key,Compare,Allocator>& x,
@@ -3031,7 +3026,7 @@ T   template <class Key, class Compare, class Allocator>
 
     template <class Key, class T, class Compare = less<Key>,
               class Allocator = allocator<pair<const Key, T> > >
-X     class map {
+T     class map {
     public:
       // types:
 T     typedef Key                                   key_type;
@@ -3041,8 +3036,8 @@ T     typedef Compare                               key_compare;
 T     typedef Allocator                             allocator_type;
 T     typedef typename Allocator::reference         reference;
 T     typedef typename Allocator::const_reference   const_reference;
-X     typedef implementation defined                iterator;
-X     typedef implementation defined                const_iterator;
+T     typedef implementation defined                iterator;
+T     typedef implementation defined                const_iterator;
 T     typedef implementation defined                size_type;
 T     typedef implementation defined                difference_type;
 T     typedef typename Allocator::pointer           pointer;
@@ -3140,7 +3135,7 @@ T   template <class Key, class T, class Compare, class Allocator>
 
     template <class Key, class T, class Compare = less<Key>,
               class Allocator = allocator<pair<const Key, T> > >
-X   class multimap {
+T   class multimap {
     public:
       // types:
 T     typedef Key                                   key_type;
@@ -3150,8 +3145,8 @@ T     typedef Compare                               key_compare;
 T     typedef Allocator                             allocator_type;
 T     typedef typename Allocator::reference         reference;
 T     typedef typename Allocator::const_reference   const_reference;
-X     typedef implementation defined                iterator;
-X     typedef implementation defined                const_iterator;
+T     typedef implementation defined                iterator;
+T     typedef implementation defined                const_iterator;
 T     typedef implementation defined                size_type;
 T     typedef implementation defined                difference_type
 T     typedef typename Allocator::pointer           pointer;
@@ -3248,7 +3243,7 @@ T   template <class Key, class T, class Compare, class Allocator>
 
     template <class Key, class Compare = less<Key>,
               class Allocator = allocator<Key> >
-X   class set {
+T   class set {
     public:
       // types:
 T     typedef Key                                   key_type;
@@ -3258,8 +3253,8 @@ T     typedef Compare                               value_compare;
 T     typedef Allocator                             allocator_type;
 T     typedef typename Allocator::reference         reference;
 T     typedef typename Allocator::const_reference   const_reference;
-X     typedef implementation defined                iterator;
-X     typedef implementation defined                const_iterator;
+T     typedef implementation defined                iterator;
+T     typedef implementation defined                const_iterator;
 T     typedef implementation defined                size_type;
 T     typedef implementation defined                difference_type;
 T     typedef typename Allocator::pointer           pointer;
@@ -3338,7 +3333,7 @@ T   template <class Key, class Compare, class Allocator>
 
     template <class Key, class Compare = less<Key>,
               class Allocator = allocator<Key> >
-X   class multiset {
+T   class multiset {
     public:
       // types:
 T     typedef Key                                   key_type;
@@ -3348,8 +3343,8 @@ T     typedef Compare                               value_compare;
 T     typedef Allocator                             allocator_type;
 T     typedef typename Allocator::reference         reference;
 T     typedef typename Allocator::const_reference   const_reference;
-X     typedef implementation defined                iterator;
-X     typedef implementation defined                const_iterator;
+T     typedef implementation defined                iterator;
+T     typedef implementation defined                const_iterator;
 T     typedef implementation defined                size_type;
 T     typedef implementation defined                difference_type
 T     typedef typename Allocator::pointer           pointer;
@@ -3430,14 +3425,7 @@ T   template <class Key, class Compare, class Allocator>
 
    Header <bitset> synopsis
 
-   [What's this stuff?
-   #include <cstddef>              // for size_t
-   #include <string>
-   #include <stdexcept>            // for invalid_argument,
-                                  //     out_of_range, overflow_error
-   #include <iosfwd>               // for istream, ostream
-   ]
-X   template <size_t N> class bitset;
+T   template <size_t N> class bitset;
     // _lib.bitset.operators_ bitset operations:
 T   template <size_t N>
       bitset<N> operator&(const bitset<N>&, const bitset<N>&);
@@ -3452,7 +3440,7 @@ T   template <class charT, class traits, size_t N>
       basic_ostream<charT, traits>&
       operator<<(basic_ostream<charT, traits>& os, const bitset<N>& x);
 
-X   template<size_t N> class bitset {
+T   template<size_t N> class bitset {
     public:
       // bit reference:
 T     class reference {
diff --git a/libstdc++-v3/docs/html/20_util/howto.html b/libstdc++-v3/docs/html/20_util/howto.html
index 9952849..af40bce 100644
--- a/libstdc++-v3/docs/html/20_util/howto.html
+++ b/libstdc++-v3/docs/html/20_util/howto.html
@@ -30,6 +30,7 @@
    <li><a href="#2"><code>auto_ptr</code> inside container classes</a></li>
    <li><a href="#3">Functors</a></li>
    <li><a href="#4">Pairs</a></li>
+   <li><a href="#5">Memory allocators</a></li>
 </ul>
 
 <hr />
@@ -207,7 +208,14 @@
       <a href="../faq/index.html">to the FAQ</a>.
    </p>
 
-
+<hr />
+<h2><a name="5">Memory allocators</a></h2>
+   <p>The available free store (&quot;heap&quot;) management classes are
+      described <a href="../ext/howto.html">here</a>.
+   </p>
+   <p>Return <a href="#top">to top of page</a> or
+      <a href="../faq/index.html">to the FAQ</a>.
+   </p>
 
 
 <!-- ####################################################### -->
diff --git a/libstdc++-v3/docs/html/documentation.html b/libstdc++-v3/docs/html/documentation.html
index 778999d..68f79f7 100644
--- a/libstdc++-v3/docs/html/documentation.html
+++ b/libstdc++-v3/docs/html/documentation.html
@@ -143,6 +143,7 @@
      <li><a href="20_util/howto.html#2"><code>auto_ptr</code> inside container classes</a></li>
      <li><a href="20_util/howto.html#3">Functors</a></li>
      <li><a href="20_util/howto.html#4">Pairs</a></li>
+     <li><a href="20_util/howto.html#5">Memory allocators</a></li>
    </ul>
    </li>
 
@@ -222,8 +223,8 @@
    <ul>
      <li><a href="ext/howto.html#1">Ropes and trees and hashes, oh my!</a></li>
      <li><a href="ext/howto.html#2">Added members and types</a></li>
-     <li><a href="ext/howto.html#3">Allocators (versions 3.0, 3.1, 3.2)</a></li>
-     <li><a href="ext/howto.html#6">Allocators (version 3.3)</a></li>
+     <li><a href="ext/howto.html#3">Allocators (versions 3.0, 3.1, 3.2, 3.3)</a></li>
+     <li><a href="ext/howto.html#6">Allocators (version 3.4)</a></li>
      <li><a href="ext/howto.html#4">Compile-time checks</a></li>
      <li><a href="ext/howto.html#5">LWG Issues</a></li>
      <li><a href="ext/../18_support/howto.html#5">Demangling</a></li>
diff --git a/libstdc++-v3/docs/html/ext/howto.html b/libstdc++-v3/docs/html/ext/howto.html
index 1fa80ad..3289619 100644
--- a/libstdc++-v3/docs/html/ext/howto.html
+++ b/libstdc++-v3/docs/html/ext/howto.html
@@ -41,8 +41,8 @@
 <ul>
    <li><a href="#1">Ropes and trees and hashes, oh my!</a></li>
    <li><a href="#2">Added members and types</a></li>
-   <li><a href="#3">Allocators (versions 3.0, 3.1, 3.2)</a></li>
-   <li><a href="#6">Allocators (version 3.3)</a></li>
+   <li><a href="#3">Allocators (versions 3.0, 3.1, 3.2, 3.3)</a></li>
+   <li><a href="#6">Allocators (version 3.4)</a></li>
    <li><a href="#4">Compile-time checks</a></li>
    <li><a href="#5">LWG Issues</a></li>
    <li><a href="../18_support/howto.html#5">Demangling</a></li>
@@ -134,7 +134,7 @@
    </p>
 
 <hr />
-<h2><a name="3">Allocators (versions 3.0, 3.1, 3.2)</a></h2>
+<h2><a name="3">Allocators (versions 3.0, 3.1, 3.2, 3.3)</a></h2>
    <p>Thread-safety, space efficiency, high speed, portability... this is a
       mess.  Where to begin?
    </p>
@@ -361,9 +361,14 @@
    </p>
 
 <hr />
-<h2><a name="6">Allocators (version 3.3)</a></h2>
+<h2><a name="6">Allocators (version 3.4)</a></h2>
    <p>Changes are coming...
    </p>
+   <p>If you plan on writing your own allocators,
+      <a href="../documentation.html#4">source documentation</a> is
+      available.  You'll need to get the &quot;maintainers&quot; collection
+      in order to see the helper classes and extra notes.
+   </p>
    <p>Return <a href="#top">to top of page</a> or
       <a href="../faq/index.html">to the FAQ</a>.
    </p>