From b142e2780cd6713ff068b5bd51302afe5c992231 Mon Sep 17 00:00:00 2001 From: Paolo Carlini Date: Mon, 24 Jan 2005 00:03:02 +0000 Subject: [PATCH] lwg-active.html, [...]: Import Revision 34. 2005-01-23 Paolo Carlini * docs/html/ext/lwg-active.html, lwg-defects.html: Import Revision 34. From-SVN: r94131 --- libstdc++-v3/ChangeLog | 4 + libstdc++-v3/docs/html/ext/lwg-active.html | 1628 ++++++++++++----- libstdc++-v3/docs/html/ext/lwg-defects.html | 1756 ++++++++++--------- 3 files changed, 2102 insertions(+), 1286 deletions(-) diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog index 854c8c22ce13..3ef5e292715a 100644 --- a/libstdc++-v3/ChangeLog +++ b/libstdc++-v3/ChangeLog @@ -1,3 +1,7 @@ +2005-01-23 Paolo Carlini + + * docs/html/ext/lwg-active.html, lwg-defects.html: Import Revision 34. + 2005-01-23 Paolo Carlini * testsuite/27_io/basic_ostream/cons/wchar_t/9827.cc: New. diff --git a/libstdc++-v3/docs/html/ext/lwg-active.html b/libstdc++-v3/docs/html/ext/lwg-active.html index 4bc5b896563a..c0e54390b4bd 100644 --- a/libstdc++-v3/docs/html/ext/lwg-active.html +++ b/libstdc++-v3/docs/html/ext/lwg-active.html @@ -5,11 +5,11 @@ - + - + @@ -20,18 +20,18 @@
Doc. no.N1708=04-0148N1753=05-0013
Date:5 Nov 20042005-01-17
Project:Matt Austern <austern@apple.com>
-

C++ Standard Library Active Issues List (Revision 33)

+

C++ Standard Library Active Issues List (Revision 34)

Reference ISO/IEC IS 14882:1998(E)

Also see:

The purpose of this document is to record the status of issues which have come before the Library Working Group (LWG) of the ANSI @@ -41,10 +41,10 @@

This document contains only library issues which are actively being considered by the Library Working Group. That is, issues which have a - status of New, Open, - Ready, and Review. See - Library Defect Reports List for issues considered defects and - Library Closed Issues List for issues considered closed.

+ status of New, Open, + Ready, and Review. See + Library Defect Reports List for issues considered defects and + Library Closed Issues List for issues considered closed.

The issues in these lists are not necessarily formal ISO Defect Reports (DR's). While some issues will eventually be elevated to @@ -88,33 +88,36 @@ directory as the issues list files.

Revision History

    +
  • R34: +2005-01 mid-term mailing. Added new issues 488-494. +
  • R33: 2004-11 post-Redmond mailing. Reflections actions taken in Redmond.
  • R32: 2004-09 pre-Redmond mailing: reflects new proposed resolutions and new issues received after the 2004-07 mailing. Added -new issues 479-481. +new issues 479-481.
  • R31: 2004-07 mid-term mailing: reflects new proposed resolutions and new issues received after the post-Sydney mailing. Added -new issues 463-478. +new issues 463-478.
  • R30: Post-Sydney mailing: reflects decisions made at the Sydney meeting. Voted all "Ready" issues from R29 into the working paper. -Added new issues 460-462. +Added new issues 460-462.
  • R29: -Pre-Sydney mailing. Added new issues 441-457. +Pre-Sydney mailing. Added new issues 441-457.
  • R28: Post-Kona mailing: reflects decisions made at the Kona meeting. -Added new issues 432-440. +Added new issues 432-440.
  • R27: -Pre-Kona mailing. Added new issues 404-431. +Pre-Kona mailing. Added new issues 404-431.
  • R26: Post-Oxford mailing: reflects decisions made at the Oxford meeting. @@ -122,139 +125,139 @@ All issues in Ready status were voted into DR status. All issues in DR status were voted into WP status.
  • R25: -Pre-Oxford mailing. Added new issues 390-402. +Pre-Oxford mailing. Added new issues 390-402.
  • R24: Post-Santa Cruz mailing: reflects decisions made at the Santa Cruz -meeting. All Ready issues from R23 with the exception of 253, which has been given a new proposed resolution, were -moved to DR status. Added new issues 383-389. (Issues 387-389 were discussed -at the meeting.) Made progress on issues 225, 226, 229: 225 and 229 have been moved to Ready status, and the only remaining -concerns with 226 involve wording. +meeting. All Ready issues from R23 with the exception of 253, which has been given a new proposed resolution, were +moved to DR status. Added new issues 383-389. (Issues 387-389 were discussed +at the meeting.) Made progress on issues 225, 226, 229: 225 and 229 have been moved to Ready status, and the only remaining +concerns with 226 involve wording.
  • R23: -Pre-Santa Cruz mailing. Added new issues 367-382. +Pre-Santa Cruz mailing. Added new issues 367-382. Moved issues in the TC to TC status.
  • R22: -Post-Curaçao mailing. Added new issues 362-366. +Post-Curaçao mailing. Added new issues 362-366.
  • R21: -Pre-Curaçao mailing. Added new issues 351-361. +Pre-Curaçao mailing. Added new issues 351-361.
  • R20: Post-Redmond mailing; reflects actions taken in Redmond. Added -new issues 336-350, of which issues -347-350 were added since Redmond, hence +new issues 336-350, of which issues +347-350 were added since Redmond, hence not discussed at the meeting. All Ready issues were moved to DR status, with the exception of issues -284, 241, and 267. +284, 241, and 267. Noteworthy issues discussed at Redmond include -120 202, 226, 233, -270, 253, 254, 323. +120 202, 226, 233, +270, 253, 254, 323.
  • R19: Pre-Redmond mailing. Added new issues -323-335. +323-335.
  • R18: Post-Copenhagen mailing; reflects actions taken in Copenhagen. -Added new issues 312-317, and discussed -new issues 271-314. +Added new issues 312-317, and discussed +new issues 271-314. Changed status of issues -103 118 136 153 -165 171 183 184 -185 186 214 221 -234 237 243 248 -251 252 256 260 -261 262 263 265 -268 +103 118 136 153 +165 171 183 184 +185 186 214 221 +234 237 243 248 +251 252 256 260 +261 262 263 265 +268 to DR. Changed status of issues -49 109 117 182 -228 230 232 235 -238 241 242 250 -259 264 266 267 -271 272 273 275 -281 284 285 286 -288 292 295 297 -298 301 303 306 -307 308 312 +49 109 117 182 +228 230 232 235 +238 241 242 250 +259 264 266 267 +271 272 273 275 +281 284 285 286 +288 292 295 297 +298 301 303 306 +307 308 312 to Ready. Closed issues -111 277 279 287 -289 293 302 313 -314 +111 277 279 287 +289 293 302 313 +314 as NAD.
  • R17: Pre-Copenhagen mailing. Converted issues list to XML. Added proposed -resolutions for issues 49, 76, 91, 235, 250, 267. -Added new issues 278-311. +resolutions for issues 49, 76, 91, 235, 250, 267. +Added new issues 278-311.
  • R16: post-Toronto mailing; reflects actions taken in Toronto. Added new -issues 265-277. Changed status of issues -3, 8, 9, 19, -26, 31, 61, -63, 86, 108, -112, 114, 115, -122, 127, 129, -134, 137, 142, -144, 146, 147, -159, 164, 170, -181, 199, 208, -209, 210, 211, -212, 217, 220, -222, 223, 224, -227 to "DR". Reopened issue 23. Reopened -issue 187. Changed issues 2 and -4 to NAD. Fixed a typo in issue 17. Fixed -issue 70: signature should be changed both places it -appears. Fixed issue 160: previous version didn't fix +issues 265-277. Changed status of issues +3, 8, 9, 19, +26, 31, 61, +63, 86, 108, +112, 114, 115, +122, 127, 129, +134, 137, 142, +144, 146, 147, +159, 164, 170, +181, 199, 208, +209, 210, 211, +212, 217, 220, +222, 223, 224, +227 to "DR". Reopened issue 23. Reopened +issue 187. Changed issues 2 and +4 to NAD. Fixed a typo in issue 17. Fixed +issue 70: signature should be changed both places it +appears. Fixed issue 160: previous version didn't fix the bug in enough places.
  • R15: pre-Toronto mailing. Added issues -233-264. Some small HTML formatting +233-264. Some small HTML formatting changes so that we pass Weblint tests.
  • R14: post-Tokyo II mailing; reflects committee actions taken in -Tokyo. Added issues 228 to 232. (00-0019R1/N1242) +Tokyo. Added issues 228 to 232. (00-0019R1/N1242)
  • R13: -pre-Tokyo II updated: Added issues 212 to 227. +pre-Tokyo II updated: Added issues 212 to 227.
  • R12: -pre-Tokyo II mailing: Added issues 199 to -211. Added "and paragraph 5" to the proposed resolution -of issue 29. Add further rationale to issue -178. +pre-Tokyo II mailing: Added issues 199 to +211. Added "and paragraph 5" to the proposed resolution +of issue 29. Add further rationale to issue +178.
  • R11: post-Kona mailing: Updated to reflect LWG and full committee actions in Kona (99-0048/N1224). Note changed resolution of issues -4 and 38. Added issues 196 -to 198. Closed issues list split into "defects" and +4 and 38. Added issues 196 +to 198. Closed issues list split into "defects" and "closed" documents. Changed the proposed resolution of issue -4 to NAD, and changed the wording of proposed resolution -of issue 38. +4 to NAD, and changed the wording of proposed resolution +of issue 38.
  • R10: -pre-Kona updated. Added proposed resolutions 83, -86, 91, 92, -109. Added issues 190 to -195. (99-0033/D1209, 14 Oct 99) +pre-Kona updated. Added proposed resolutions 83, +86, 91, 92, +109. Added issues 190 to +195. (99-0033/D1209, 14 Oct 99)
  • R9: -pre-Kona mailing. Added issues 140 to -189. Issues list split into separate "active" and +pre-Kona mailing. Added issues 140 to +189. Issues list split into separate "active" and "closed" documents. (99-0030/N1206, 25 Aug 99)
  • R8: @@ -262,36 +265,36 @@ post-Dublin mailing. Updated to reflect LWG and full committee actions in Dublin. (99-0016/N1193, 21 Apr 99)
  • R7: -pre-Dublin updated: Added issues 130, 131, -132, 133, 134, -135, 136, 137, -138, 139 (31 Mar 99) +pre-Dublin updated: Added issues 130, 131, +132, 133, 134, +135, 136, 137, +138, 139 (31 Mar 99)
  • R6: -pre-Dublin mailing. Added issues 127, 128, -and 129. (99-0007/N1194, 22 Feb 99) +pre-Dublin mailing. Added issues 127, 128, +and 129. (99-0007/N1194, 22 Feb 99)
  • R5: -update issues 103, 112; added issues -114 to 126. Format revisions to prepare +update issues 103, 112; added issues +114 to 126. Format revisions to prepare for making list public. (30 Dec 98)
  • R4: -post-Santa Cruz II updated: Issues 110, -111, 112, 113 added, several +post-Santa Cruz II updated: Issues 110, +111, 112, 113 added, several issues corrected. (22 Oct 98)
  • R3: -post-Santa Cruz II: Issues 94 to 109 +post-Santa Cruz II: Issues 94 to 109 added, many issues updated to reflect LWG consensus (12 Oct 98)
  • R2: -pre-Santa Cruz II: Issues 73 to 93 added, -issue 17 updated. (29 Sep 98) +pre-Santa Cruz II: Issues 73 to 93 added, +issue 17 updated. (29 Sep 98)
  • R1: -Correction to issue 55 resolution, 60 code -format, 64 title. (17 Sep 98) +Correction to issue 55 resolution, 60 code +format, 64 title. (17 Sep 98)

@@ -366,24 +369,24 @@ format, New when +

Issues are always given the status of New when they first appear on the issues list. They may progress to - Open or Review while the LWG + Open or Review while the LWG is actively working on them. When the LWG has reached consensus on the disposition of an issue, the status will then change to - Dup, NAD, or Ready as appropriate. Once the full J16 committee votes to + Dup, NAD, or Ready as appropriate. Once the full J16 committee votes to forward Ready issues to the Project Editor, they are given the - status of Defect Report ( DR). These in turn may - become the basis for Technical Corrigenda (TC), + status of Defect Report ( DR). These in turn may + become the basis for Technical Corrigenda (TC), or are closed without action other than a Record of Response - (RR ). The intent of this LWG process is that + (RR ). The intent of this LWG process is that only issues which are truly defects in the Standard move to the formal ISO DR status.

Active Issues

-

23. Num_get overflow result

Section: 22.2.2.1.2 [lib.facet.num.get.virtuals]  Status: Open  Submitter: Nathan Myers  Date: 6 Aug 1998

+

23. Num_get overflow result

Section: 22.2.2.1.2 [lib.facet.num.get.virtuals]  Status: Open  Submitter: Nathan Myers  Date: 6 Aug 1998

The current description of numeric input does not account for the possibility of overflow. This is an implicit result of changing the description to rely on the definition of scanf() (which fails to @@ -408,7 +411,7 @@ and hard to trace, so I will describe it briefly:

  • - According to 22.2.2.1.2 [lib.facet.num.get.virtuals] + According to 22.2.2.1.2 [lib.facet.num.get.virtuals] paragraph 11 failbit is set if scanf() would return an input error; otherwise a value is converted to the rules of scanf. @@ -502,10 +505,10 @@ upon overflow. We considered three options based on this:

    it.

    Proposed resolution:

    -

    typo: 22.2.2.2.2 [lib.facet.num.put.virtuals], para 2, bullet 3. Strike "in." from +

    typo: 22.2.2.2.2 [lib.facet.num.put.virtuals], para 2, bullet 3. Strike "in." from the end.

    -

    Change 22.2.2.2 [lib.locale.nm.put], para 11, bullet 2 from:

    +

    Change 22.2.2.2 [lib.locale.nm.put], para 11, bullet 2 from:

    The sequence of chars accumulated in stage 2 would have caused scanf to report an input failure. ios_base::failbit is @@ -535,7 +538,7 @@ what kind of error happened. Martin will provide wording, Howard may help.]

    -

    96. Vector<bool> is not a container

    Section: 23.2.5 [lib.vector.bool]  Status: Open  Submitter: AFNOR  Date: 7 Oct 1998

    +

    96. Vector<bool> is not a container

    Section: 23.2.5 [lib.vector.bool]  Status: Open  Submitter: AFNOR  Date: 7 Oct 1998

    vector<bool> is not a container as its reference and pointer types are not references and pointers.

    @@ -602,7 +605,7 @@ solution.]

    be a fully conforming container. These options are not mutually exclusive.]

    -

    130. Return type of container::erase(iterator) differs for associative containers

    Section: 23.1.2 [lib.associative.reqmts], 23.1.1 [lib.sequence.reqmts]  Status: Ready  Submitter: Andrew Koenig  Date: 2 Mar 1999

    +

    130. Return type of container::erase(iterator) differs for associative containers

    Section: 23.1.2 [lib.associative.reqmts], 23.1.1 [lib.sequence.reqmts]  Status: Ready  Submitter: Andrew Koenig  Date: 2 Mar 1999

    Table 67 (23.1.1) says that container::erase(iterator) returns an iterator. Table 69 (23.1.2) says that in addition to this requirement, associative containers also say that container::erase(iterator) @@ -612,7 +615,7 @@ fail to meet the requirements for containers.

    Proposed resolution:

    -In 23.1.2 [lib.associative.reqmts], in Table 69 Associative container +In 23.1.2 [lib.associative.reqmts], in Table 69 Associative container requirements, change the return type of a.erase(q) from void to iterator. Change the assertion/not/pre/post-condition from "erases the element pointed to @@ -623,7 +626,7 @@ is returned."

    -In 23.1.2 [lib.associative.reqmts], in Table 69 Associative container +In 23.1.2 [lib.associative.reqmts], in Table 69 Associative container requirements, change the return type of a.erase(q1, q2) from void to iterator. Change the assertion/not/pre/post-condition from "erases the elements in the @@ -632,10 +635,10 @@ q2). Returns q2."

    -In 23.3.1 [lib.map], in the map class synopsis; and -in 23.3.2 [lib.multimap], in the multimap class synopsis; and -in 23.3.3 [lib.set], in the set class synopsis; and -in 23.3.4 [lib.multiset], in the multiset class synopsis: +In 23.3.1 [lib.map], in the map class synopsis; and +in 23.3.2 [lib.multimap], in the multimap class synopsis; and +in 23.3.3 [lib.set], in the set class synopsis; and +in 23.3.4 [lib.multiset], in the multiset class synopsis: change the signature of the first erase overload to 

       iterator erase(iterator position);
@@ -661,7 +664,7 @@ Matt provided wording.]
    
 ]
    
 
 
    
-
    197. max_size() underspecified
    Section: 20.1.5  [lib.allocator.requirements], 23.1  [lib.container.requirements]  Status: Open  Submitter: Andy Sawyer  Date: 21 Oct 1999
    
+
    197. max_size() underspecified
    Section: 20.1.5  [lib.allocator.requirements], 23.1  [lib.container.requirements]  Status: Open  Submitter: Andy Sawyer  Date: 21 Oct 1999
    
 
    Must the value returned by max_size() be unchanged from call to call? 
    
 
 
    Must the value returned from max_size() be meaningful? 
    
@@ -693,21 +696,21 @@ into account the actual currently available resources). This,
 obviously, has to be determined dynamically each time max_size() is
 called. 
    
 
    Proposed resolution:
    
-
    Change 20.1.5  [lib.allocator.requirements] table 32 max_size() wording from:
    
+
    Change 20.1.5  [lib.allocator.requirements] table 32 max_size() wording from:
    
 
    
       the largest value that can meaningfully be 
 passed to X::allocate
     
 to:
    
       the value of the largest constant expression
-(5.19  [expr.const]) that could ever meaningfully be passed to X::allocate
    
+(5.19  [expr.const]) that could ever meaningfully be passed to X::allocate
    
 
 
    
-Change 23.1  [lib.container.requirements] table 65 max_size() wording from:
    
+Change 23.1  [lib.container.requirements] table 65 max_size() wording from:
    
 
    
       size() of the largest possible container.
    
 to:
    
       the value of the largest constant expression
-(5.19  [expr.const]) that could ever meaningfully be returned by X::size().
+(5.19  [expr.const]) that could ever meaningfully be returned by X::size().
 
    
 
 
    [Kona: The LWG informally discussed this and asked Andy Sawyer to submit
@@ -716,7 +719,7 @@ an issue.]
    
 
    [Tokyo: The LWG believes (1) above is the intended meaning.]
    
 
 
    [Post-Tokyo: Beman Dawes supplied the above resolution at the
-request of the LWG. 21.3.3  [lib.string.capacity] was not changed because it
+request of the LWG. 21.3.3  [lib.string.capacity] was not changed because it
 references max_size() in 23.1.  The term "compile-time" was
 avoided because it is not defined anywhere in the standard (even
 though it is used several places in the library clauses).]
    
@@ -727,7 +730,7 @@ function than as an allocator member function.  For the latter,
 it is probably best thought of as an architectural limit.
 Nathan will provide new wording.]
    
 
    
-
    201. Numeric limits terminology wrong
    Section: 18.2.1  [lib.limits]  Status: Open  Submitter: Stephen Cleary  Date: 21 Dec 1999
    
+
    201. Numeric limits terminology wrong
    Section: 18.2.1  [lib.limits]  Status: Open  Submitter: Stephen Cleary  Date: 21 Dec 1999
    
 
    
 In some places in this section, the terms "fundamental types" and
 "scalar types" are used when the term "arithmetic types" is intended.
@@ -822,7 +825,7 @@ types and for user-defined types, and the standard doesn't make it
 clear how numeric_limits applies to each of those cases.  A wholesale
 review of numeric_limits is needed.  A paper would be welcome.]
    
 
    
-
    233. Insertion hints in associative containers
    Section: 23.1.2  [lib.associative.reqmts]  Status: Open  Submitter: Andrew Koenig  Date: 30 Apr 2000
    
+
    233. Insertion hints in associative containers
    Section: 23.1.2  [lib.associative.reqmts]  Status: Open  Submitter: Andrew Koenig  Date: 30 Apr 2000
    
 
    
 If mm is a multimap and p is an iterator
 into the multimap, then mm.insert(p, x) inserts
@@ -857,7 +860,7 @@ proposed "before or after, if possible, otherwise [...]".
 
 
    Proposed resolution:
    
 
-
    In table 69 "Associative Container Requirements" in 23.1.2  [lib.associative.reqmts], in the row for a.insert(p, t),
+
    In table 69 "Associative Container Requirements" in 23.1.2  [lib.associative.reqmts], in the row for a.insert(p, t),
 change
    
 
 
    
@@ -918,7 +921,7 @@ enough to make the detailed semantics hard to satisfy."]
    
 suggests so the LWG can decide between the two options.]
    
 
 
    
-
    247. vector, deque::insert complexity
    Section: 23.2.4.3  [lib.vector.modifiers]  Status: Open  Submitter: Lisa Lippincott  Date: 06 June 2000
    
+
    247. vector, deque::insert complexity
    Section: 23.2.4.3  [lib.vector.modifiers]  Status: Open  Submitter: Lisa Lippincott  Date: 06 June 2000
    
 
    Paragraph 2 of 23.2.4.3 [lib.vector.modifiers] describes the complexity
 of vector::insert:
    
 
@@ -951,7 +954,7 @@ inserting at the end of the vector, and then using
 
 
    I looked to see if deque had a similar problem, and was
 surprised to find that deque places no requirement on the
-complexity of inserting multiple elements (23.2.1.3  [lib.deque.modifiers],
+complexity of inserting multiple elements (23.2.1.3  [lib.deque.modifiers],
 paragraph 3):
    
 
    
    
@@ -988,7 +991,7 @@ complicated than a while loop whose body is a single-element
 insert.]
    
 
    
 
    254. Exception types in clause 19 are constructed from std::string
-
    Section: 19.1  [lib.std.exceptions]  Status: Open  Submitter: Dave Abrahams  Date: 01 Aug 2000
    
+
    Section: 19.1  [lib.std.exceptions]  Status: Open  Submitter: Dave Abrahams  Date: 01 Aug 2000
    
 
    
 Many of the standard exception types which implementations are
 required to throw are constructed with a const std::string&
@@ -1078,7 +1081,7 @@ copy constructor is potentially invoked during stack unwinding.
    
 
    The copy constructor is a more serious problem, becuase failure
 during stack unwinding invokes terminate.  The copy
 constructor must be nothrow. Curaçao: Howard thinks this
-requirement is already present.
    
+requirement may already be present.
    
 
 
    The fundamental problem is that it's difficult to get the nothrow
 requirement to work well with the requirement that the exception
@@ -1088,8 +1091,8 @@ include:
    
 
 
      
 
    • Limit the size of a string that exception objects are required to
-throw: change the postconditions of 19.1.2  [lib.domain.error] paragraph 3
-and 19.1.6  [lib.runtime.error] paragraph 3 to something like this:
+throw: change the postconditions of 19.1.2  [lib.domain.error] paragraph 3
+and 19.1.6  [lib.runtime.error] paragraph 3 to something like this:
 "strncmp(what(), what_arg._str(), N) == 0, where N is an
 implementation defined constant no smaller than 256".
      • 
 
    • Allow the const string& constructor to throw, but not the
@@ -1110,11 +1113,6 @@ throw, the string must compare equal to the argument.
      • 
 exception-derived class is not necessarily a bad thing.  And the
 bad_alloc constructor already has a no throw spec on it (18.4.2.1).
      
 
-
      
-The copy constructors of all exception-derived classes already have a
-no throw spec.  Reference 18.6.1,  19.1 and 15.4/13.
-
      
-
 
      Future:
      
 
 
      All involved would like to see const char* constructors added, but
@@ -1126,12 +1124,17 @@ mechanism (in a future C++ language).  As they stand, the copy
 constructors might fail via a call to unexpected.  I think what is
 intended here is that the copy constructors can't fail.
      
 
-
      [Pre-Sydney: reopened at the request of Howard Hinnant.]
      
+
      [Pre-Sydney: reopened at the request of Howard Hinnant.
+  Post-Redmond: James Kanze noticed that the copy constructors of
+  exception-derived classes do not have nothrow clauses.  Those
+  classes have no copy constructors declared, meaning the
+  compiler-generated implicit copy constructors are used, and those
+  compiler-generated constructors might in principle throw anything.]
      
 
 
      
-
      258. Missing allocator requirement
      Section: 20.1.5  [lib.allocator.requirements]  Status: Open  Submitter: Matt Austern  Date: 22 Aug 2000
      
+
      258. Missing allocator requirement
      Section: 20.1.5  [lib.allocator.requirements]  Status: Open  Submitter: Matt Austern  Date: 22 Aug 2000
      
 
      
->From lib-7752:
+From lib-7752:
 
      
 
 
      
@@ -1198,10 +1201,10 @@ the second line from the bottom in table 32 already implies the
 desired property.  This issue should be considered in light of
 other issues related to allocator instances.]
      
 
      
-
      280. Comparison of reverse_iterator to const reverse_iterator
      Section: 24.4.1  [lib.reverse.iterators]  Status: Open  Submitter: Steve Cleary  Date: 27 Nov 2000
      
+
      280. Comparison of reverse_iterator to const reverse_iterator
      Section: 24.4.1  [lib.reverse.iterators]  Status: Open  Submitter: Steve Cleary  Date: 27 Nov 2000
      
 
      
 This came from an email from Steve Cleary to Fergus in reference to
-issue 179. The library working group briefly discussed
+issue 179. The library working group briefly discussed
 this in Toronto and believed it should be a separate issue.  There was
 also some reservations about whether this was a worthwhile problem to
 fix.
@@ -1222,7 +1225,7 @@ that, I don't see how any user code could break."
 
      
 
      Proposed resolution:
      
 
      
-Section: 24.4.1.1  [lib.reverse.iterator]
+Section: 24.4.1.1  [lib.reverse.iterator]
 add/change the following declarations:
      
 
        A) Add a templated assignment operator, after the same manner
         as the templated copy constructor, i.e.:
@@ -1248,7 +1251,7 @@ add/change the following declarations:
      
 
      
 
      
 Also make the addition/changes for these signatures in 
-24.4.1.3  [lib.reverse.iter.ops].
+24.4.1.3  [lib.reverse.iter.ops].
 
      
 
 
      [
@@ -1260,7 +1263,7 @@ desirable to provide this feature in a different way.
 ]
      
 
 
      
-
      290. Requirements to for_each and its function object
      Section: 25.1.1  [lib.alg.foreach]  Status: Open  Submitter: Angelika Langer  Date: 03 Jan 2001
      
+
      290. Requirements to for_each and its function object
      Section: 25.1.1  [lib.alg.foreach]  Status: Open  Submitter: Angelika Langer  Date: 03 Jan 2001
      
 
      The specification of the for_each algorithm does not have a
 "Requires" section, which means that there are no
 restrictions imposed on the function object whatsoever. In essence it
@@ -1288,7 +1291,7 @@ algorithm does not say so.
 
      Proposed resolution:
      
 
      Add a "Requires" section to section 25.1.1 similar to those
 proposed for transform and the numeric algorithms (see issue
-242):
+242):
 
      
 
 
      
@@ -1304,8 +1307,8 @@ blanket statement in Clause 25, not just a special requirement for
 ]
      
 
 
      
-
      294. User defined macros and standard headers
      Section: 17.4.3.1.1  [lib.macro.names]  Status: Open  Submitter: James Kanze  Date: 11 Jan 2001
      
-
      Paragraph 2 of 17.4.3.1.1  [lib.macro.names] reads: "A
+
      294. User defined macros and standard headers
      Section: 17.4.3.1.1  [lib.macro.names]  Status: Open  Submitter: James Kanze  Date: 11 Jan 2001
      
+
      Paragraph 2 of 17.4.3.1.1  [lib.macro.names] reads: "A
 translation unit that includes a header shall not contain any macros
 that define names declared in that header." As I read this, it
 would mean that the following program is legal:
      
@@ -1321,30 +1324,30 @@ which <sstream> didn't include <string>.
      
 
      I think that this phrase was probably formulated before it was
 decided that a standard header may freely include other standard
 headers.  The phrase would be perfectly appropriate for C, for
-example.  In light of 17.4.4.1  [lib.res.on.headers] paragraph 1, however,
+example.  In light of 17.4.4.1  [lib.res.on.headers] paragraph 1, however,
 it isn't stringent enough.
      
 
      Proposed resolution:
      
-
      In paragraph 2 of 17.4.3.1.1  [lib.macro.names], change "A
+
      In paragraph 2 of 17.4.3.1.1  [lib.macro.names], change "A
 translation unit that includes a header shall not contain any macros
 that define names declared in that header." to "A
 translation unit that includes a header shall not contain any macros
 that define names declared in any standard header."
      
 
 
      [Copenhagen: the general idea is clearly correct, but there is
-concern about making sure that the two paragraphs in 17.4.3.1.1  [lib.macro.names] remain consistent.  Nathan will provide new 
+concern about making sure that the two paragraphs in 17.4.3.1.1  [lib.macro.names] remain consistent.  Nathan will provide new 
 wording.]
      
 
 
      
-
      299. Incorrect return types for iterator dereference
      Section: 24.1.4  [lib.bidirectional.iterators], 24.1.5  [lib.random.access.iterators]  Status: Open  Submitter: John Potter  Date: 22 Jan 2001
      
+
      299. Incorrect return types for iterator dereference
      Section: 24.1.4  [lib.bidirectional.iterators], 24.1.5  [lib.random.access.iterators]  Status: Open  Submitter: John Potter  Date: 22 Jan 2001
      
 
      
-In section 24.1.4  [lib.bidirectional.iterators],
+In section 24.1.4  [lib.bidirectional.iterators],
 Table 75 gives the return type of *r-- as convertible to T.  This is
 not consistent with Table 74 which gives the return type of *r++ as
 T&.  *r++ = t is valid while *r-- = t is invalid.
 
      
 
 
      
-In section 24.1.5  [lib.random.access.iterators],
+In section 24.1.5  [lib.random.access.iterators],
 Table 76 gives the return type of a[n] as convertible to T.  This is
 not consistent with the semantics of *(a + n) which returns T& by
 Table 74.  *(a + n) = t is valid while a[n] = t is invalid.
@@ -1435,11 +1438,11 @@ with a return type of convertible to T and operational semantics of
 
      
 
 
      
-
      309. Does sentry catch exceptions?
      Section: 27.6  [lib.iostream.format]  Status: Open  Submitter: Martin Sebor  Date: 19 Mar 2001
      
+
      309. Does sentry catch exceptions?
      Section: 27.6  [lib.iostream.format]  Status: Open  Submitter: Martin Sebor  Date: 19 Mar 2001
      
 
      
 The descriptions of the constructors of basic_istream<>::sentry
-(27.6.1.1.2  [lib.istream::sentry]) and basic_ostream<>::sentry
-(27.6.2.3  [lib.ostream::sentry]) do not explain what the functions do in
+(27.6.1.1.2  [lib.istream::sentry]) and basic_ostream<>::sentry
+(27.6.2.3  [lib.ostream::sentry]) do not explain what the functions do in
 case an exception is thrown while they execute. Some current
 implementations allow all exceptions to propagate, others catch them
 and set ios_base::badbit instead, still others catch some but let
@@ -1450,16 +1453,16 @@ others propagate.
 The text also mentions that the functions may call setstate(failbit)
 (without actually saying on what object, but presumably the stream
 argument is meant).  That may have been fine for
-basic_istream<>::sentry prior to issue 195, since
+basic_istream<>::sentry prior to issue 195, since
 the function performs an input operation which may fail. However,
-issue 195 amends 27.6.1.1.2  [lib.istream::sentry], p2 to
+issue 195 amends 27.6.1.1.2  [lib.istream::sentry], p2 to
 clarify that the function should actually call setstate(failbit |
 eofbit), so the sentence in p3 is redundant or even somewhat
 contradictory.
 
      
 
 
      
-The same sentence that appears in 27.6.2.3  [lib.ostream::sentry], p3
+The same sentence that appears in 27.6.2.3  [lib.ostream::sentry], p3
 doesn't seem to be very meaningful for basic_istream<>::sentry
 which performs no input. It is actually rather misleading since it
 would appear to guide library implementers to calling
@@ -1664,9 +1667,9 @@ result of a call to strm.clear().
 
 
 
      Proposed resolution:
      
-
      Remove the last sentence of 27.6.1.1.2  [lib.istream::sentry] p5 (but not
+
      Remove the last sentence of 27.6.1.1.2  [lib.istream::sentry] p5 (but not
   the footnote, which should be moved to the preceding sentence).
      
-
      Remove the last sentence of 27.6.2.3  [lib.ostream::sentry] p3 (but not
+
      Remove the last sentence of 27.6.2.3  [lib.ostream::sentry] p3 (but not
   the footnote, which should be moved to the preceding sentence).
      
 
      Rationale:
      
 
      The LWG feels that no clarification of EH policy is necessary: the
@@ -1674,11 +1677,11 @@ result of a call to strm.clear().
   performs, and about which of those operations can throw.  However, the
   sentence at the end should be removed because it's redundant.
      
 
      
-
      342. seek and eofbit
      Section: 27.6.1.3  [lib.istream.unformatted]  Status: Open  Submitter: Howard Hinnant  Date: 09 Oct 201
      
+
      342. seek and eofbit
      Section: 27.6.1.3  [lib.istream.unformatted]  Status: Open  Submitter: Howard Hinnant  Date: 09 Oct 201
      
 
      I think we have a defect.
      
 
-
      According to lwg issue 60 which is now a dr, the
-description of seekg in 27.6.1.3  [lib.istream.unformatted] paragraph 38 now looks
+
      According to lwg issue 60 which is now a dr, the
+description of seekg in 27.6.1.3  [lib.istream.unformatted] paragraph 38 now looks
 like:
      
 
 
      
@@ -1689,7 +1692,7 @@ gcount(). After constructing a sentry object, if fail() != true,
 executes rdbuf()­>pubseekpos( pos).
 
      
 
-
      And according to lwg issue 243 which is also now a dr,
+
      And according to lwg issue 243 which is also now a dr,
 27.6.1.3, paragraph 1 looks like:
      
 
 
      
@@ -1754,7 +1757,7 @@ examined by the user to determine why something failed.
      
   and propose a resolution.]
      
 
 
      
-
      356. Meaning of ctype_base::mask enumerators
      Section: 22.2.1  [lib.category.ctype]  Status: Open  Submitter: Matt Austern  Date: 23 Jan 2002
      
+
      356. Meaning of ctype_base::mask enumerators
      Section: 22.2.1  [lib.category.ctype]  Status: Open  Submitter: Matt Austern  Date: 23 Jan 2002
      
 
 
      What should the following program print?
      
 
@@ -1798,7 +1801,7 @@ The above program assumes that ctype_base::mask enumerators like
 space and print are disjoint, and that the way to
 say that a character is both a space and a printing character is to or
 those two enumerators together.  This is suggested by the "exposition
-only" values in 22.2.1  [lib.category.ctype], but it is nowhere specified in
+only" values in 22.2.1  [lib.category.ctype], but it is nowhere specified in
 normative text.  An alternative interpretation is that the more
 specific categories subsume the less specific.  The above program
 gives the results it does on the Microsoft compiler because, on that
@@ -1823,8 +1826,8 @@ lib-9224, lib-9226, lib-9229, lib-9270, lib-9272, lib-9273, lib-9274,
 lib-9277, lib-9279.
 
      
 
-
      Issue 339 is related, but not identical.  The
-proposed resolution if issue 339 says that
+
      Issue 339 is related, but not identical.  The
+proposed resolution if issue 339 says that
 ctype_base::mask must be a bitmask type. It does not say that the
 ctype_base::mask elements are bitmask elements, so it doesn't
 directly affect this issue.
      
@@ -1896,9 +1899,9 @@ option 1 is required for C99 compatibility.
 ]
      
 
 
      
-
      362. bind1st/bind2nd type safety
      Section: 20.3.6.2  [lib.bind.1st]  Status: Open  Submitter: Andrew Demkin  Date: 26 Apr 2002
      
+
      362. bind1st/bind2nd type safety
      Section: 20.3.6.2  [lib.bind.1st]  Status: Open  Submitter: Andrew Demkin  Date: 26 Apr 2002
      
 
      
-The definition of bind1st() (20.3.6.2  [lib.bind.1st]) can result in
+The definition of bind1st() (20.3.6.2  [lib.bind.1st]) can result in
 the construction of an unsafe binding between incompatible pointer
 types. For example, given a function whose first parameter type is
 'pointer to T', it's possible without error to bind an argument of
@@ -1926,12 +1929,12 @@ map its argument to the expected argument type of the bound function

    -A functional-style conversion (5.2.3 [expr.type.conv]) is defined to be -semantically equivalent to an explicit cast expression (5.4 [expr.cast]), which may (according to 5.4, paragraph 5) be interpreted +A functional-style conversion (5.2.3 [expr.type.conv]) is defined to be +semantically equivalent to an explicit cast expression (5.4 [expr.cast]), which may (according to 5.4, paragraph 5) be interpreted as a reinterpret_cast, thus masking the error.

    -

    The problem and proposed change also apply to 20.3.6.4 [lib.bind.2nd].

    +

    The problem and proposed change also apply to 20.3.6.4 [lib.bind.2nd].

    Proposed resolution:

    The simplest and most localized change to prevent such errors is to @@ -1962,7 +1965,7 @@ programming. all. Jeremy will check with the original author of this part of the Standard and will see what the original intent was.]

    -

    366. Excessive const-qualification

    Section: 27 [lib.input.output]  Status: Open  Submitter: Walter Brown, Marc Paterno  Date: 10 May 2002

    +

    366. Excessive const-qualification

    Section: 27 [lib.input.output]  Status: Open  Submitter: Walter Brown, Marc Paterno  Date: 10 May 2002

    The following member functions are declared const, yet return non-const pointers. We believe they are should be changed, because they allow code @@ -2064,9 +2067,9 @@ those terms, does not appear in the standard.]

    const basic_filebuf<charT,traits>* rdbuf() const;
    -

    368. basic_string::replace has two "Throws" paragraphs

    Section: 21.3.5.6 [lib.string::replace]  Status: Open  Submitter: Beman Dawes  Date: 3 Jun 2002

    +

    368. basic_string::replace has two "Throws" paragraphs

    Section: 21.3.5.6 [lib.string::replace]  Status: Open  Submitter: Beman Dawes  Date: 3 Jun 2002

    -21.3.5.6 [lib.string::replace] basic_string::replace, second +21.3.5.6 [lib.string::replace] basic_string::replace, second signature, given in paragraph 1, has two "Throws" paragraphs (3 and 5).

    @@ -2082,7 +2085,7 @@ part of the "Effects" paragraph. Someone who understands string replace well needs to work on this.]

    -

    369. io stream objects and static ctors

    Section: 27.3 [lib.iostream.objects]  Status: Open  Submitter: Ruslan Abdikeev  Date: 8 Jul 2002

    +

    369. io stream objects and static ctors

    Section: 27.3 [lib.iostream.objects]  Status: Open  Submitter: Ruslan Abdikeev  Date: 8 Jul 2002

    Is it safe to use standard iostream objects from constructors of static objects? Are standard iostream objects constructed and are @@ -2213,7 +2216,7 @@ including the following example: int main () { return i; }

    -

    371. Stability of multiset and multimap member functions

    Section: 23.1 [lib.container.requirements]  Status: Open  Submitter: Frank Compagner  Date: 20 Jul 2002

    +

    371. Stability of multiset and multimap member functions

    Section: 23.1 [lib.container.requirements]  Status: Open  Submitter: Frank Compagner  Date: 20 Jul 2002

    The requirements for multiset and multimap containers (23.1 [lib.containers.requirements], 23.1.2 [lib.associative.reqmnts], @@ -2265,7 +2268,7 @@ be hard to track down by users. This would also make the need for an erase_if() member function that much greater.

    -

    This issue is somewhat related to LWG issue 130.

    +

    This issue is somewhat related to LWG issue 130.

    [Santa Cruz: More people need to look at this. Much user code may assume stability. On the other hand, it seems drastic to add a @@ -2273,9 +2276,9 @@ erase_if() member function that much greater.

    Proposed resolution:

    -

    376. basic_streambuf semantics

    Section: 27.7.1.3 [lib.stringbuf.virtuals]  Status: Open  Submitter: Ray Lischner  Date: 14 Aug 2002

    +

    376. basic_streambuf semantics

    Section: 27.7.1.3 [lib.stringbuf.virtuals]  Status: Open  Submitter: Ray Lischner  Date: 14 Aug 2002

    -In Section 27.7.1.3 [lib.stringbuf.virtuals], Table 90, the implication is that +In Section 27.7.1.3 [lib.stringbuf.virtuals], Table 90, the implication is that the four conditions should be mutually exclusive, but they are not. The first two cases, as written, are subcases of the third. I think it would be clearer if the conditions were rewritten as follows: @@ -2313,7 +2316,7 @@ implementations before we decide on a solution.]

    Proposed resolution:

    -

    382. codecvt do_in/out result

    Section: 22.2.1.5 [lib.locale.codecvt]  Status: Open  Submitter: Martin Sebor  Date: 30 Aug 2002

    +

    382. codecvt do_in/out result

    Section: 22.2.1.5 [lib.locale.codecvt]  Status: Open  Submitter: Martin Sebor  Date: 30 Aug 2002

    It seems that the descriptions of codecvt do_in() and do_out() leave sufficient room for interpretation so that two implementations of @@ -2338,7 +2341,7 @@ the following seems less than adequately specified:

    1. - 22.2.1.5.2 [lib.locale.codecvt.virtuals], p2 says this about the effects of the + 22.2.1.5.2 [lib.locale.codecvt.virtuals], p2 says this about the effects of the function: ...Stops if it encounters a character it cannot convert... This assumes that there *is* a character to convert. What happens when there is a sequence that doesn't form a @@ -2371,7 +2374,7 @@ the following seems less than adequately specified:

    -Finally, the conditions described at the end of 22.2.1.5.2 [lib.locale.codecvt.virtuals], p4 don't seem to be possible: +Finally, the conditions described at the end of 22.2.1.5.2 [lib.locale.codecvt.virtuals], p4 don't seem to be possible:

    "A return value of partial, if (from_next == from_end), @@ -2385,7 +2388,7 @@ If the value is partial, it's not clear to me that (from_next ==from_end) could ever hold if there isn't enough room in the destination buffer. In order for (from_next==from_end) to hold, all characters in that range must have been successfully -converted (according to 22.2.1.5.2 [lib.locale.codecvt.virtuals], p2) and since there are no +converted (according to 22.2.1.5.2 [lib.locale.codecvt.virtuals], p2) and since there are no further source characters to convert, no more room in the destination buffer can be needed.

    @@ -2482,9 +2485,9 @@ written with the assumption of 1->N conversion in mind, not M->N. Bill, Howard, and Martin will provide new wording. ]

    -

    384. equal_range has unimplementable runtime complexity

    Section: 25.3.3.3 [lib.equal.range]  Status: Open  Submitter: Hans Bos  Date: 18 Oct 2002

    +

    384. equal_range has unimplementable runtime complexity

    Section: 25.3.3.3 [lib.equal.range]  Status: Open  Submitter: Hans Bos  Date: 18 Oct 2002

    -Section 25.3.3.3 [lib.equal.range] +Section 25.3.3.3 [lib.equal.range] states that at most 2 * log(last - first) + 1 comparisons are allowed for equal_range.

    @@ -2529,11 +2532,11 @@ other questions matter.)]

    Proposed resolution:

    -

    385. Does call by value imply the CopyConstructible requirement?

    Section: 17 [lib.library]  Status: Open  Submitter: Matt Austern  Date: 23 Oct 2002

    +

    385. Does call by value imply the CopyConstructible requirement?

    Section: 17 [lib.library]  Status: Open  Submitter: Matt Austern  Date: 23 Oct 2002

    Many function templates have parameters that are passed by value; a typical example is find_if's pred parameter in -25.1.2 [lib.alg.find]. Are the corresponding template parameters +25.1.2 [lib.alg.find]. Are the corresponding template parameters (Predicate in this case) implicitly required to be CopyConstructible, or does that need to be spelled out explicitly?

    @@ -2552,8 +2555,8 @@ my_predicate& is not CopyConstructible.

    The scope of this problem, if it is a problem, is unknown. Function -object arguments to generic algorithms in clauses 25 [lib.algorithms] -and 26 [lib.numerics] are obvious examples. A review of the whole +object arguments to generic algorithms in clauses 25 [lib.algorithms] +and 26 [lib.numerics] are obvious examples. A review of the whole library is necessary.

    Proposed resolution:

    @@ -2565,8 +2568,8 @@ into references? References aren't copy constructible, so this should not be allowed. ]

    -

    386. Reverse iterator's operator[] has impossible return type

    Section: 24.4.1.3.11 [lib.reverse.iter.opindex]  Status: Ready  Submitter: Matt Austern  Date: 23 Oct 2002

    -

    In 24.4.1.3.11 [lib.reverse.iter.opindex], reverse_iterator<>::operator[] +

    386. Reverse iterator's operator[] has impossible return type

    Section: 24.4.1.3.11 [lib.reverse.iter.opindex]  Status: Ready  Submitter: Matt Austern  Date: 23 Oct 2002

    +

    In 24.4.1.3.11 [lib.reverse.iter.opindex], reverse_iterator<>::operator[] is specified as having a return type of reverse_iterator::reference, which is the same as iterator_traits<Iterator>::reference. (Where Iterator is the underlying iterator type.)

    @@ -2578,7 +2581,7 @@ which is the same as iterator_traits<Iterator>::reference. to Iterator's value type. The return type specified for reverse_iterator's operator[] would thus appear to be impossible.

    -

    With the resolution of issue 299, the type of +

    With the resolution of issue 299, the type of a[n] will continue to be required (for random access iterators) to be convertible to the value type, and also a[n] = t will be a valid expression. Implementations of @@ -2590,7 +2593,7 @@ which is the same as iterator_traits<Iterator>::reference.

    Proposed resolution:

    -

    In 24.4.1.2 [lib.reverse.iter.requirements] change:

    +

    In 24.4.1.2 [lib.reverse.iter.requirements] change:

    reference operator[](difference_type n) const;
@@ -2616,7 +2619,7 @@ Comments from Dave Abrahams: IMO we should resolve 386 by just saying
     readable and writable, which is about as good as we can do.
 ]
    
 
    
-
    387. std::complex over-encapsulated
    Section: 26.2  [lib.complex.numbers]  Status: Open  Submitter: Gabriel Dos Reis  Date: 8 Nov 2002
    
+
    387. std::complex over-encapsulated
    Section: 26.2  [lib.complex.numbers]  Status: Open  Submitter: Gabriel Dos Reis  Date: 8 Nov 2002
    
 
    
 The absence of explicit description of std::complex<T> layout
 makes it imposible to reuse existing software developed in traditional
@@ -2648,7 +2651,7 @@ of std::complex<> is not justified.
 
    
 
 
    Proposed resolution:
    
-
    Add the following requirements to 26.2  [lib.complex.numbers] as 26.2/4:
    
+
    Add the following requirements to 26.2  [lib.complex.numbers] as 26.2/4:
    
 
    
 
    If z is an lvalue expression of type cv std::complex<T> then
    
 
@@ -2675,7 +2678,7 @@ imaginary part of a[i].
-

In the header synopsis in 26.2.1 [lib.complex.synopsis], replace

+

In the header synopsis in 26.2.1 [lib.complex.synopsis], replace

  template<class T> T real(const complex<T>&);
   template<class T> T imag(const complex<T>&);
@@ -2688,7 +2691,7 @@ imaginary part of a[i]. template<class T> T& imag( complex<T>&); -

In 26.2.7 [lib.complex.value.ops] paragraph 1, change

+

In 26.2.7 [lib.complex.value.ops] paragraph 1, change

  template<class T> T real(const complex<T>&);

to

@@ -2698,7 +2701,7 @@ imaginary part of a[i].

and change the Returns clause to "Returns: The real part of x

. -

In 26.2.7 [lib.complex.value.ops] paragraph 2, change

+

In 26.2.7 [lib.complex.value.ops] paragraph 2, change

  template<class T> T imag(const complex<T>&);

to

@@ -2726,7 +2729,7 @@ part of x

. justification for this change even without other considerations. All existing implementations already have the layout proposed here.

-

394. behavior of formatted output on failure

Section: 27.6.2.5.1 [lib.ostream.formatted.reqmts]  Status: Open  Submitter: Martin Sebor  Date: 27 Dec 2002

+

394. behavior of formatted output on failure

Section: 27.6.2.5.1 [lib.ostream.formatted.reqmts]  Status: Open  Submitter: Martin Sebor  Date: 27 Dec 2002

There is a contradiction in Formatted output about what bit is supposed to be set if the formatting fails. On sentence says it's @@ -2821,7 +2824,7 @@ functions should be changed as proposed below.

Rationale:

-

396. what are characters zero and one

Section: 23.3.5.1 [lib.bitset.cons]  Status: Open  Submitter: Martin Sebor  Date: 5 Jan 2003

+

396. what are characters zero and one

Section: 23.3.5.1 [lib.bitset.cons]  Status: Open  Submitter: Martin Sebor  Date: 5 Jan 2003

23.3.5.1, p6 [lib.bitset.cons] talks about a generic character having the value of 0 or 1 but there is no definition of what @@ -2855,7 +2858,7 @@ is a bitset, not a string.

Proposed resolution:

Change the constructor's function declaration immediately before -23.3.5.1 [lib.bitset.cons] p3 to:

+23.3.5.1 [lib.bitset.cons] p3 to:

    template <class charT, class traits, class Allocator>
     explicit
     bitset(const basic_string<charT, traits, Allocator>& str,
@@ -2864,7 +2867,7 @@ is a bitset, not a string.
              basic_string<charT, traits, Allocator>::npos,
            charT zero = charT('0'), charT one = charT('1'))
-

Change the first two sentences of 23.3.5.1 [lib.bitset.cons] p6 to: "An +

Change the first two sentences of 23.3.5.1 [lib.bitset.cons] p6 to: "An element of the constructed string has value 0 if the corresponding character in str, beginning at position pos, is zero. Otherwise, the element has the value 1.

@@ -2877,15 +2880,15 @@ is zero. Otherwise, the element has the value 1.

Change the declaration of the to_string member function - immediately before 23.3.5.2 [lib.bitset.members] p33 to:

+ immediately before 23.3.5.2 [lib.bitset.members] p33 to:

    template <class charT, class traits, class Allocator>
     basic_string<charT, traits, Allocator> 
     to_string(charT zero = charT('0'), charT one = charT('1')) const;
-

Change the last sentence of 23.3.5.2 [lib.bitset.members] p33 to: "Bit +

Change the last sentence of 23.3.5.2 [lib.bitset.members] p33 to: "Bit value 0 becomes the character zero, bit value 1 becomes the character one.

-

Change 23.3.5.3 [lib.bitset.operators] p8 to:

+

Change 23.3.5.3 [lib.bitset.operators] p8 to:

Returns:

  os << x.template to_string<charT,traits,allocator<charT> >(
       use_facet<ctype<charT> >(os.getloc()).widen('0'),
@@ -2901,10 +2904,10 @@ is zero. Otherwise, the element has the value 1.

   resolution allows those users who care about this issue to get it
   right.

 
We fix the inserter to use the new arguments.  Note that we already
-  fixed the analogous problem with the extractor in issue 303.

+  fixed the analogous problem with the extractor in issue 303.

 
 

-
397. ostream::sentry dtor throws exceptions
Section: 27.6.2.3  [lib.ostream::sentry]  Status: Open  Submitter: Martin Sebor  Date: 5 Jan 2003

+
397. ostream::sentry dtor throws exceptions
Section: 27.6.2.3  [lib.ostream::sentry]  Status: Open  Submitter: Martin Sebor  Date: 5 Jan 2003

     

 17.4.4.8, p3 prohibits library dtors from throwing exceptions.
     

@@ -2936,7 +2939,7 @@ is the only one that can throw.  PJP suggests specifying that
 sentry::~sentry() should internally catch any exceptions it might cause.
 ]

 

-
398. effects of end-of-file on unformatted input functions
Section: 27.6.2.3  [lib.ostream::sentry]  Status: Open  Submitter: Martin Sebor  Date: 5 Jan 2003

+
398. effects of end-of-file on unformatted input functions
Section: 27.6.2.3  [lib.ostream::sentry]  Status: Open  Submitter: Martin Sebor  Date: 5 Jan 2003

     

 While reviewing unformatted input member functions of istream
 for their behavior when they encounter end-of-file during input
@@ -3051,9 +3054,9 @@ end-of-file):
   and changing it on an individual basis wouldn't make things better.
   Dietmar will do this work.

 

-
401.  incorrect type casts in table 32 in lib.allocator.requirements
Section: 20.1.5  [lib.allocator.requirements]  Status: Open  Submitter: Markus Mauhart  Date: 27 Feb 2003

+
401.  incorrect type casts in table 32 in lib.allocator.requirements
Section: 20.1.5  [lib.allocator.requirements]  Status: Open  Submitter: Markus Mauhart  Date: 27 Feb 2003

 

-I think that in par2 of 20.1.5  [lib.allocator.requirements] the last two
+I think that in par2 of 20.1.5  [lib.allocator.requirements] the last two
 lines of table 32 contain two incorrect type casts. The lines are ...
 

 
@@ -3090,7 +3093,7 @@ current requirement (being a random access iterator).
 

 Note: Actually I would prefer to replace "((T*)p)?->dtor_name" with
 "p?->dtor_name", but AFAICS this is not possible cause of an omission
-in 13.5.6  [over.ref] (for which I have filed another DR on 29.11.2002).
+in 13.5.6  [over.ref] (for which I have filed another DR on 29.11.2002).
 

 
 
[Kona: The LWG thinks this is somewhere on the border between
@@ -3102,7 +3105,7 @@ in 13.5.6 
406. vector::insert(s) exception safety
Section: 23.2.4.3  [lib.vector.modifiers]  Status: Ready  Submitter: Dave Abrahams  Date: 27 Apr 2003

+
406. vector::insert(s) exception safety
Section: 23.2.4.3  [lib.vector.modifiers]  Status: Ready  Submitter: Dave Abrahams  Date: 27 Apr 2003

 

 There is a possible defect in the standard: the standard text was
 never intended to prevent arbitrary ForwardIterators, whose operations
@@ -3113,7 +3116,7 @@ standard appears to impose requirements that aren't met by any
 existing implementation.
 

 
Proposed resolution:

-
Replace 23.2.4.3  [lib.vector.modifiers] paragraph 1 with:

+
Replace 23.2.4.3  [lib.vector.modifiers] paragraph 1 with:

 

   1- Notes: Causes reallocation if the new size is greater than the
   old capacity. If no reallocation happens, all the iterators and
@@ -3125,14 +3128,14 @@ existing implementation.
 
[We probably need to say something similar for deque.]

 
 

-
408. Is vector<reverse_iterator<char*> > forbidden?
Section: 24.1  [lib.iterator.requirements]  Status: Open  Submitter: Nathan Myers  Date: 3 June 2003

+
408. Is vector<reverse_iterator<char*> > forbidden?
Section: 24.1  [lib.iterator.requirements]  Status: Open  Submitter: Nathan Myers  Date: 3 June 2003

 

 I've been discussing iterator semantics with Dave Abrahams, and a 
 surprise has popped up.  I don't think this has been discussed before.
 

 
 

-24.1  [lib.iterator.requirements] says that the only operation that can be performed on "singular"
+24.1  [lib.iterator.requirements] says that the only operation that can be performed on "singular"
 iterator values is to assign a non-singular value to them.  (It 
 doesn't say they can be destroyed, and that's probably a defect.)  
 Some implementations have taken this to imply that there is no need 
@@ -3182,7 +3185,7 @@ T(), and so copying is defined if the result of T() is copyable.
 

 
 

-Issue 235, which defines reverse_iterator's default
+Issue 235, which defines reverse_iterator's default
 constructor more precisely, has some relevance to this issue.
 However, it is not the whole story.
 

@@ -3208,7 +3211,7 @@ uninitialized, and possibly equal to an existing pointer value, or
 
 

 8.5 paragraph 5 seems to make clear that the second is required to
-satisfy DR 235, at least for non-class Iterator argument
+satisfy DR 235, at least for non-class Iterator argument
 types.
 

 
@@ -3235,7 +3238,7 @@ are default-initialized, and it should explicitly allow destroying any
 iterator value, singular or not, default-initialized or not.
 

 
-
Related issue: 407

+
Related issue: 407

 
Proposed resolution:

 
 
[
@@ -3249,9 +3252,9 @@ wrong to impose so strict a requirement for iterators.
 ]

 
 

-
409. Closing an fstream should clear error state
Section: 27.8.1.7  [lib.ifstream.members], 27.8.1.10  [lib.ofstream.members]  Status: Ready  Submitter: Nathan Myers  Date: 3 June 2003

+
409. Closing an fstream should clear error state
Section: 27.8.1.7  [lib.ifstream.members], 27.8.1.10  [lib.ofstream.members]  Status: Ready  Submitter: Nathan Myers  Date: 3 June 2003

 

-A strict reading of 27.8.1  [lib.fstreams] shows that opening or
+A strict reading of 27.8.1  [lib.fstreams] shows that opening or
 closing a basic_[io]fstream does not affect the error bits.  This
 means, for example, that if you read through a file up to EOF, and
 then close the stream and reopen it at the beginning of the file,
@@ -3259,7 +3262,7 @@ the EOF bit in the stream's error state is still set.  This is
 counterintuitive.
 

 

-The LWG considered this issue once before, as issue 22,
+The LWG considered this issue once before, as issue 22,
 and put in a footnote to clarify that the strict reading was indeed
 correct.  We did that because we believed the standard was
 unambiguous and consistent, and that we should not make architectural
@@ -3268,7 +3271,7 @@ language, those considerations no longer apply.
 

 
Proposed resolution:

 
-
Change 27.8.1.7  [lib.ifstream.members], para. 3 from:

+
Change 27.8.1.7  [lib.ifstream.members], para. 3 from:

 
 

 Calls rdbuf()->open(s,mode|in). If that function returns a null
@@ -3283,7 +3286,7 @@ a null pointer, calls setstate(failbit) (which may throw
 ios_base::failure [Footnote: (lib.iostate.flags)), else calls clear().
 

 
-
Change 27.8.1.10  [lib.ofstream.members], para. 3 from:

+
Change 27.8.1.10  [lib.ofstream.members], para. 3 from:

 
 
Calls rdbuf()->open(s,mode|out). If that function
 returns a null pointer, calls setstate(failbit) (which may throw
@@ -3297,7 +3300,7 @@ returns a null pointer, calls setstate(failbit) (which may throw
 ios_base::failure [Footnote: (lib.iostate.flags)), else calls clear().
 

 
-
Change 27.8.1.13  [lib.fstream.members], para. 3 from:

+
Change 27.8.1.13  [lib.fstream.members], para. 3 from:

 
 
Calls rdbuf()->open(s,mode), If that function returns a
 null pointer, calls setstate(failbit), (which may throw
@@ -3324,7 +3327,7 @@ flags.]

   of the three fstream class template instead.]

 
 

-
413. Proposed resolution to LDR#64 still wrong
Section: 27.6.1.2.3  [lib.istream::extractors]  Status: Ready  Submitter: Bo Persson  Date: 13 Jul 2003

+
413. Proposed resolution to LDR#64 still wrong
Section: 27.6.1.2.3  [lib.istream::extractors]  Status: Ready  Submitter: Bo Persson  Date: 13 Jul 2003

 

 The second sentence of the proposed resolution says:
 

@@ -3343,7 +3346,7 @@ basic_istream (*this) and inserting into sb. I can't really tell if
 
[
 Sydney: Definitely a real issue. We are, indeed, extracting characters
 from an istream and not from sb. The problem was there in the FDIS and
-wasn't fixed by issue 64. Probably what was intended was
+wasn't fixed by issue 64. Probably what was intended was
 to have *this instead of sb. We're talking about the exception flag
 state of a basic_istream object, and there's only one basic_istream
 object in this discussion, so that would be a consistent
@@ -3369,7 +3372,7 @@ while extracting characters from *this and failbit is on in exceptions(),
 then the caught exception is rethrown.
 

 

-
416. definitions of XXX_MIN and XXX_MAX macros in climits
Section: 18.2.2  [lib.c.limits]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

+
416. definitions of XXX_MIN and XXX_MAX macros in climits
Section: 18.2.2  [lib.c.limits]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

         

 
 Given two overloads of the function foo(), one taking an argument of type
@@ -3418,7 +3421,7 @@ where the actual type is easily detectable by overload resolution.
   <climits>.]

 
 

-
417. what does ctype::do_widen() return on failure
Section: 22.2.1.1.2  [lib.locale.ctype.virtuals]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

+
417. what does ctype::do_widen() return on failure
Section: 22.2.1.1.2  [lib.locale.ctype.virtuals]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

 

 The Effects and Returns clauses of the do_widen() member function of
 the ctype facet fail to specify the behavior of the function on failure.
@@ -3440,7 +3443,7 @@ and iostream to reliably detect this failure.
   existing library components aren't written with the assumption
   that widen can throw.]

 

-
418. exceptions thrown during iostream cleanup
Section: 27.4.2.1.6  [lib.ios::Init]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

+
418. exceptions thrown during iostream cleanup
Section: 27.4.2.1.6  [lib.ios::Init]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

 

 The dtor of the ios_base::Init object is supposed to call flush() on the
 6 standard iostream objects cout, cerr, clog, wcout, wcerr, and wclog.
@@ -3466,7 +3469,7 @@ object throws.
   might reasonably swallow the exception, or call abort, or do
   something even more drastic.]

 

-
419. istream extractors not setting failbit if eofbit is already set
Section: 27.6.1.1.2  [lib.istream::sentry]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

+
419. istream extractors not setting failbit if eofbit is already set
Section: 27.6.1.1.2  [lib.istream::sentry]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

         

 
 27.6.1.1.2, p2 says that istream::sentry ctor prepares for input if is.good()
@@ -3544,7 +3547,7 @@ corrected.
   clearer.
 
   
 

-
421. is basic_streambuf copy-constructible?
Section: 27.5.2.1  [lib.streambuf.cons]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

+
421. is basic_streambuf copy-constructible?
Section: 27.5.2.1  [lib.streambuf.cons]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

 

 The reflector thread starting with c++std-lib-11346 notes that the class
 template basic_streambuf, along with basic_stringbuf and basic_filebuf,
@@ -3563,7 +3566,7 @@ of the standard provide a compiler-generated copy ctor and assignment
 operator yet fail to specify their semantics.  It's believed that the
 only types for which this is actually a problem (i.e. types where the
 compiler-generated default may be inappropriate and may not have been
-intended) are locale facets.  See issue 439.
+intended) are locale facets.  See issue 439.
 

 
Proposed resolution:

 

@@ -3715,7 +3718,7 @@ basic_filebuf.
 

 
 

-
422. explicit specializations of member functions of class templates
Section: 17.4.3.1  [lib.reserved.names]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

+
422. explicit specializations of member functions of class templates
Section: 17.4.3.1  [lib.reserved.names]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

 

 It has been suggested that 17.4.3.1, p1 may or may not allow programs to
 explicitly specialize members of standard templates on user-defined types.
@@ -3729,7 +3732,7 @@ the program) by relying on the "as if" rule.
 
Proposed resolution:

 
 

-  Add the following sentence immediately after the text of 17.4.3.1  [lib.reserved.names], p1:
+  Add the following sentence immediately after the text of 17.4.3.1  [lib.reserved.names], p1:
 

 
 

@@ -3753,7 +3756,7 @@ library class templates. We need to consult with CWG to make sure we
 use the right wording.]

 
 

-
423. effects of negative streamsize in iostreams
Section: 27  [lib.input.output]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

+
423. effects of negative streamsize in iostreams
Section: 27  [lib.input.output]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

 
 

 A third party test suite tries to exercise istream::ignore(N) with
@@ -3783,7 +3786,7 @@ ostream::write().
   negative.  Martin will do that review.]

 
 

-
424. normative notes
Section: 17.3.1.1  [lib.structure.summary]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

+
424. normative notes
Section: 17.3.1.1  [lib.structure.summary]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

 
 

 The text in 17.3.1.1, p1 says:
@@ -3834,7 +3837,7 @@ None of these lists is meant to be exhaustive.
 ]

 
 

-
427. stage 2 and rationale of DR 221
Section: 22.2.2.1.2  [lib.facet.num.get.virtuals]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

+
427. stage 2 and rationale of DR 221
Section: 22.2.2.1.2  [lib.facet.num.get.virtuals]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

 

 The requirements specified in Stage 2 and reiterated in the rationale
 of DR 221 (and echoed again in DR 303) specify that num_get<charT>::
@@ -3865,7 +3868,7 @@ instantiate the num_get template on user-defined types.
   and traits is in order.  The LWG considered and rejected the
   possibility of changing numeric facets to use narrowing instead of
   widening.  This may be a good idea for other reasons (see issue
-  459), but it doesn't solve the problem raised by this
+  459), but it doesn't solve the problem raised by this
   issue.  Whether we use widen or narrow the num_get facet
   still has no idea which traits class the user wants to use for 
   the comparison, because only streams, not facets, are passed traits
@@ -3881,7 +3884,7 @@ traits classes, then the facet could reasonably be required to
 use char_traits<charT>
.
 
 

-
430. valarray subset operations
Section: 26.3.2.4  [lib.valarray.sub]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

+
430. valarray subset operations
Section: 26.3.2.4  [lib.valarray.sub]  Status: Open  Submitter: Martin Sebor  Date: 18 Sep 2003

 

 The standard fails to specify the behavior of valarray::operator[](slice)
 and other valarray subset operations when they are passed an "invalid"
@@ -3895,8 +3898,8 @@ object (e.g., slice (2, 1, 1) for a valarray of size 1).
   performance, so we don't want to require specific checking.  We
   need wording to express this decision.]

 

-
431. Swapping containers with unequal allocators
Section: 20.1.5  [lib.allocator.requirements], 25  [lib.algorithms]  Status: Open  Submitter: Matt Austern  Date: 20 Sep 2003

-
Clause 20.1.5  [lib.allocator.requirements] paragraph 4 says that implementations
+
431. Swapping containers with unequal allocators
Section: 20.1.5  [lib.allocator.requirements], 25  [lib.algorithms]  Status: Open  Submitter: Matt Austern  Date: 20 Sep 2003

+
Clause 20.1.5  [lib.allocator.requirements] paragraph 4 says that implementations
   are permitted to supply containers that are unable to cope with
   allocator instances and that container implementations may assume
   that all instances of an allocator type compare equal.  We gave
@@ -3942,7 +3945,7 @@ object (e.g., slice (2, 1, 1) for a valarray of size 1).
 
[pre-Sydney: Howard argues for option 3 in n1599.]

 
 

-
434. bitset::to_string() hard to use
Section: 23.3.5.2  [lib.bitset.members]  Status: Ready  Submitter: Martin Sebor  Date: 15 Oct 2003

+
434. bitset::to_string() hard to use
Section: 23.3.5.2  [lib.bitset.members]  Status: Ready  Submitter: Martin Sebor  Date: 15 Oct 2003

 

 It has been pointed out a number of times that the bitset to_string() member
 function template is tedious to use since callers must explicitly specify the
@@ -3982,9 +3985,9 @@ to_string() member function template:

 ]

 
 

-
438. Ambiguity in the "do the right thing" clause
Section: 23.1.1  [lib.sequence.reqmts]  Status: Ready  Submitter: Howard Hinnant  Date: 20 Oct 2003

+
438. Ambiguity in the "do the right thing" clause
Section: 23.1.1  [lib.sequence.reqmts]  Status: Ready  Submitter: Howard Hinnant  Date: 20 Oct 2003

 
-
Section 23.1.1  [lib.sequence.reqmts], paragraphs 9-11, fixed up the problem
+
Section 23.1.1  [lib.sequence.reqmts], paragraphs 9-11, fixed up the problem
 noticed with statements like:

 
vector<int> v(10, 1);
 

@@ -4180,7 +4183,7 @@ T implicit_cast(const U& u)
 
 
Proposed resolution:

 
-Replace 23.1.1  [lib.sequence.reqmts] paragraphs 9 - 11 with:
+Replace 23.1.1  [lib.sequence.reqmts] paragraphs 9 - 11 with:
 
 
For every sequence defined in this clause and in clause lib.strings:

 
@@ -4305,10 +4308,10 @@ then the implementation must reject the constructor as A is no longer
 implicitly convertible to B.
 

 

-
444. Bad use of casts in fstream
Section: 27.8.1  [lib.fstreams]  Status: Ready  Submitter: Vincent Leloup  Date: 20 Nov 2003

+
444. Bad use of casts in fstream
Section: 27.8.1  [lib.fstreams]  Status: Ready  Submitter: Vincent Leloup  Date: 20 Nov 2003

 

-27.8.1.7  [lib.ifstream.members] p1, 27.8.1.10  [lib.ofstream.members] p1, 27.8.1.13  [lib.fstream.members] p1 seems have same problem as exposed in LWG issue
-252.
+27.8.1.7  [lib.ifstream.members] p1, 27.8.1.10  [lib.ofstream.members] p1, 27.8.1.13  [lib.fstream.members] p1 seems have same problem as exposed in LWG issue
+252.
 

 
Proposed resolution:

 
@@ -4350,7 +4353,7 @@ implicitly convertible to B.
 
 
 

-
445. iterator_traits::reference unspecified for some iterator categories
Section: 24.3.1  [lib.iterator.traits]  Status: Ready  Submitter: Dave Abrahams  Date: 9 Dec 2003

+
445. iterator_traits::reference unspecified for some iterator categories
Section: 24.3.1  [lib.iterator.traits]  Status: Ready  Submitter: Dave Abrahams  Date: 9 Dec 2003

 

 The standard places no restrictions at all on the reference type
 of input, output, or forward iterators (for forward iterators it
@@ -4443,7 +4446,7 @@ so I've changed the wording to say that those types may be
 
 
Proposed resolution:

 
-
In 24.3.1  [lib.iterator.traits], after:

+
In 24.3.1  [lib.iterator.traits], after:

 
 

 be defined as the iterator's difference type, value type and iterator
@@ -4462,7 +4465,7 @@ is, the same type as the type of *a and a->,
 respectively.
 

 
-
In 24.3.1  [lib.iterator.traits], change:

+
In 24.3.1  [lib.iterator.traits], change:

 
 

 In the case of an output iterator, the types
@@ -4483,7 +4486,7 @@ iterator_traits<Iterator>::pointer
 may be defined as void.
 

 
-
In 24.5.3  [lib.istreambuf.iterator], change:

+
In 24.5.3  [lib.istreambuf.iterator], change:

 

 
typename traits::off_type, charT*, charT&>
 

@@ -4502,7 +4505,7 @@ needed to be changed.
 ]

 
 

-
446. Iterator equality between different containers
Section: 24.1  [lib.iterator.requirements], 23.1  [lib.container.requirements]  Status: Open  Submitter: Andy Koenig  Date: 16 Dec 2003

+
446. Iterator equality between different containers
Section: 24.1  [lib.iterator.requirements], 23.1  [lib.container.requirements]  Status: Open  Submitter: Andy Koenig  Date: 16 Dec 2003

 

 What requirements does the standard place on equality comparisons between
 iterators that refer to elements of different containers.  For example, if
@@ -4526,7 +4529,7 @@ reachability.
 ]

 
 

-
453. basic_stringbuf::seekoff need not always fail for an empty stream
Section: 27.7.1.3  [lib.stringbuf.virtuals]  Status: Ready  Submitter: Bill Plauger  Date: 30 Jan 2004

+
453. basic_stringbuf::seekoff need not always fail for an empty stream
Section: 27.7.1.3  [lib.stringbuf.virtuals]  Status: Ready  Submitter: Bill Plauger  Date: 30 Jan 2004

 
  pos_type basic_stringbuf::seekoff(off_type, ios_base::seekdir,
                                     ios_base::openmode);
 

@@ -4556,7 +4559,7 @@ gptr() or pptr()) is a null pointer and the new offset newoff
 is nonzero, the positioning operation fails.
 

 

-
454. basic_filebuf::open should accept wchar_t names
Section: 27.8.1.3  [lib.filebuf.members]  Status: Ready  Submitter: Bill Plauger  Date: 30 Jan 2004

+
454. basic_filebuf::open should accept wchar_t names
Section: 27.8.1.3  [lib.filebuf.members]  Status: Ready  Submitter: Bill Plauger  Date: 30 Jan 2004

 
    basic_filebuf *basic_filebuf::open(const char *, ios_base::open_mode);
 

 
@@ -4628,7 +4631,7 @@ counterargument, which most but not all LWG members accepted, is that
 the mapping between narrow files names and files is also
 implemenation defined.

 

-
455. cerr::tie() and wcerr::tie() are overspecified
Section: 27.3  [lib.iostream.objects]  Status: Ready  Submitter: Bill Plauger  Date: 30 Jan 2004

+
455. cerr::tie() and wcerr::tie() are overspecified
Section: 27.3  [lib.iostream.objects]  Status: Ready  Submitter: Bill Plauger  Date: 30 Jan 2004

 

 Both cerr::tie() and wcerr::tie() are obliged to be null at program
 startup. This is overspecification and overkill. It is both traditional
@@ -4657,7 +4660,7 @@ Its state is otherwise the same as required for basic_ios<wchar_t>::init
   permit, cout and cerr to be tied on startup.  Pre-Redmond: Bill will
   provide wording.]

 

-
456. Traditional C header files are overspecified
Section: 17.4.1.2  [lib.headers]  Status: Open  Submitter: Bill Plauger  Date: 30 Jan 2004

+
456. Traditional C header files are overspecified
Section: 17.4.1.2  [lib.headers]  Status: Open  Submitter: Bill Plauger  Date: 30 Jan 2004

 
 
The C++ Standard effectively requires that the traditional C headers
 (of the form <xxx.h>) be defined in terms of the newer C++
@@ -4741,7 +4744,7 @@ declaring C names in headers.
 
 
Proposed resolution:

 

-
457. bitset constructor: incorrect number of initialized bits
Section: 23.3.5.1  [lib.bitset.cons]  Status: Ready  Submitter: Dag Henriksson  Date: 30 Jan 2004

+
457. bitset constructor: incorrect number of initialized bits
Section: 23.3.5.1  [lib.bitset.cons]  Status: Ready  Submitter: Dag Henriksson  Date: 30 Jan 2004

 

 The constructor from unsigned long says it initializes "the first M
 bit positions to the corresponding bit values in val. M is the smaller
@@ -4755,14 +4758,14 @@ uses to hold the value. Thus, the first M bit position above is not
 guaranteed to have any corresponding bit values in val.
 

 
Proposed resolution:

-
In 23.3.5.1  [lib.bitset.cons] paragraph 2, change "M is the smaller of
+
In 23.3.5.1  [lib.bitset.cons] paragraph 2, change "M is the smaller of
   N and the value CHAR_BIT * sizeof (unsigned long). (249)" to
   "M is the smaller of N and the number of bits in
-  the value representation (section 3.9  [basic.types]) of unsigned
+  the value representation (section 3.9  [basic.types]) of unsigned
   long."
 

 

-
458. 24.1.5 contains unintented limitation for operator-
Section: 24.1.5  [lib.random.access.iterators]  Status: Open  Submitter: Daniel Frey  Date: 27 Feb 2004

+
458. 24.1.5 contains unintented limitation for operator-
Section: 24.1.5  [lib.random.access.iterators]  Status: Open  Submitter: Daniel Frey  Date: 27 Feb 2004

 

 In 24.1.5 [lib.random.access.iterators], table 76 the operational
 semantics for the expression "r -= n" are defined as "return r += -n".
@@ -4791,7 +4794,7 @@ operational semantics for this column to:
 
 
 

-
459. Requirement for widening in stage 2 is overspecification
Section: 22.2.2.1.2  [lib.facet.num.get.virtuals]  Status: Open  Submitter: Martin Sebor  Date: 16 Mar 2004

+
459. Requirement for widening in stage 2 is overspecification
Section: 22.2.2.1.2  [lib.facet.num.get.virtuals]  Status: Open  Submitter: Martin Sebor  Date: 16 Mar 2004

 
When parsing strings of wide-character digits, the standard
   requires the library to widen narrow-character "atoms" and compare
   the widened atoms against the characters that are being parsed.
@@ -4835,11 +4838,11 @@ drastic. Existing implementations with the exception of libstdc++
 currently already use narrow() so the impact of the change on programs
 would presumably be isolated to just a single implementation. Further,
 since narrow() is not required to translate alternate wide digit
-representations such as those mentioned in issue 303 to
+representations such as those mentioned in issue 303 to
 their narrow equivalents (i.e., the portable source characters '0'
 through '9'), the change does not necessarily imply that these
 alternate digits would be treated as ordinary digits and accepted as
-part of numbers during parsing. In fact, the requirement in 22.2.1.1.2  [lib.locale.ctype.virtuals], p13 forbids narrow() to translate an alternate
+part of numbers during parsing. In fact, the requirement in 22.2.1.1.2  [lib.locale.ctype.virtuals], p13 forbids narrow() to translate an alternate
 digit character, wc, to an ordinary digit in the basic source
 character set unless the expression
 (ctype<charT>::is(ctype_base::digit, wc) == true) holds. This in
@@ -4868,7 +4871,7 @@ technique to perform the comparison:

       if it the source and destination types are the same
 
 

-
460. Default modes missing from basic_fstream member specifications
Section: 27.8.1  [lib.fstreams]  Status: Ready  Submitter: Ben Hutchings  Date: 1 Apr 2004

+
460. Default modes missing from basic_fstream member specifications
Section: 27.8.1  [lib.fstreams]  Status: Ready  Submitter: Ben Hutchings  Date: 1 Apr 2004

 

 The second parameters of the non-default constructor and of the open
 member function for basic_fstream, named "mode", are optional
@@ -4879,21 +4882,21 @@ constructor declaration has the "explicit" function-specifier implying
 that it is intended to be callable with one argument.
 

 
Proposed resolution:

-
In 27.8.1.12  [lib.fstream.cons], change

+
In 27.8.1.12  [lib.fstream.cons], change

 
  explicit basic_fstream(const char* s, ios_base::openmode mode); 
 

 
to

 
  explicit basic_fstream(const char* s,
                          ios_base::openmode mode = ios_base::in|ios_base::out);
 

-
In 27.8.1.13  [lib.fstream.members], change

+
In 27.8.1.13  [lib.fstream.members], change

 
  void open(const char*s, ios_base::openmode mode); 
 

 
to

   void open(const char*s,
             ios_base::openmode mode = ios_base::in|ios_base::out);
 

-
461. time_get hard or impossible to implement
Section: 22.2.5.1.2  [lib.locale.time.get.virtuals]  Status: Review  Submitter: Bill Plauger  Date: 23 Mar 2004

+
461. time_get hard or impossible to implement
Section: 22.2.5.1.2  [lib.locale.time.get.virtuals]  Status: Review  Submitter: Bill Plauger  Date: 23 Mar 2004

 

 Template time_get currently contains difficult, if not impossible,
 requirements for do_date_order, do_get_time, and do_get_date. All require
@@ -4980,7 +4983,7 @@ on the value returned by date_order() as follows:
 ]

 
 

-
462. Destroying objects with static storage duration
Section: 3.6.3  [basic.start.term], 18.3  [lib.support.start.term]  Status: Open  Submitter: Bill Plauger  Date: 23 Mar 2004

+
462. Destroying objects with static storage duration
Section: 3.6.3  [basic.start.term], 18.3  [lib.support.start.term]  Status: Open  Submitter: Bill Plauger  Date: 23 Mar 2004

 

 3.6.3 Termination spells out in detail the interleaving of static
 destructor calls and calls to functions registered with atexit. To
@@ -5014,7 +5017,7 @@ even if we don't require it.
 

 

 

-
463. auto_ptr usability issues
Section: 20.4.5  [lib.auto.ptr]  Status: Open  Submitter: Rani Sharoni  Date: 7 Dec 2003

+
463. auto_ptr usability issues
Section: 20.4.5  [lib.auto.ptr]  Status: Open  Submitter: Rani Sharoni  Date: 7 Dec 2003

 
 

 TC1 CWG DR #84 effectively made the template<class Y> operator auto_ptr<Y>()
@@ -5268,7 +5271,7 @@ from r-value derived to base).
   want to fix auto_ptr for C++-0x, or remove it and replace it with
   move_ptr and unique_ptr.]

 

-
464. Suggestion for new member functions in standard containers
Section: 23.2.4  [lib.vector], 23.3.1  [lib.map]  Status: Review  Submitter: Thorsten Ottosen  Date: 12 May 2004

+
464. Suggestion for new member functions in standard containers
Section: 23.2.4  [lib.vector], 23.3.1  [lib.map]  Status: Review  Submitter: Thorsten Ottosen  Date: 12 May 2004

 
 
To add slightly more convenience to vector<T> and map<Key,T> we should consider to add

 
    
@@ -5292,14 +5295,14 @@ at() (which will then throw if the vector is empty). 
 
 
 
    Proposed resolution:
    
-
    In 23.2.4  [lib.vector], add the following to the vector
+
    In 23.2.4  [lib.vector], add the following to the vector
   synopsis after "element access" and before "modifiers":
    
 
      // [lib.vector.data] data access
   pointer       data();
   const_pointer data() const;
 
    
 
-
    Add a new subsection of 23.2.4  [lib.vector]:
    
+
    Add a new subsection of 23.2.4  [lib.vector]:
    
 
    
 
    23.2.4.x vector data access
    
 
       pointer       data();
@@ -5311,13 +5314,13 @@ at() (which will then throw if the vector is empty). 
 
    Throws: Nothing.
    
 
    
 
-
    In 23.3.1  [lib.map], add the following to the map
+
    In 23.3.1  [lib.map], add the following to the map
 synopsis immediately after the line for operator[]:
    
 
      T&       at(const key_type& x);
   const T& at(const key_type& x) const;
 
    
 
-
    Add the following to 23.3.1.2  [lib.map.access]:
    
+
    Add the following to 23.3.1.2  [lib.map.access]:
    
 
    
 
      T&       at(const key_type& x);
   const T& at(const key_type& x) const;
@@ -5335,11 +5338,11 @@ synopsis immediately after the line for operator[]:
    
   exception type chosen for at, std::out_of_range,
   was chosen to match vector::at.
    
 
    
-
    465. Contents of <ciso646>
    Section: 17.4.1.2  [lib.headers]  Status: Review  Submitter: Steve Clamage  Date: 3 Jun 2004
    
+
    465. Contents of <ciso646>
    Section: 17.4.1.2  [lib.headers]  Status: Review  Submitter: Steve Clamage  Date: 3 Jun 2004
    
 
    C header <iso646.h> defines macros for some operators, such as
 not_eq for !=.
    
 
-
    Section 17.4.1.2  [lib.headers] "Headers" says that except as noted in
+
    Section 17.4.1.2  [lib.headers] "Headers" says that except as noted in
 clauses 18 through 27, the <cname> C++ header contents are the same
 as the C header <name.h>. In particular, table 12 lists
 <ciso646> as a C++ header.
    
@@ -5369,7 +5372,7 @@ or <ciso646> has no effect. 
    
 
    [post-Redmond: Steve provided wording.]
    
 
 
    
-
    466. basic_string ctor should prevent null pointer error
    Section: 21.3.1  [lib.string.cons]  Status: Open  Submitter: Daniel Frey  Date: 10 Jun 2004
    
+
    466. basic_string ctor should prevent null pointer error
    Section: 21.3.1  [lib.string.cons]  Status: Open  Submitter: Daniel Frey  Date: 10 Jun 2004
    
 
    
 Today, my colleagues and me wasted a lot of time. After some time, I
 found the problem. It could be reduced to the following short example:
@@ -5398,7 +5401,7 @@ ambiguate any other legal ctors.
    
   value is a null pointer), at run time, or both.]
    
 
 
    
-
    467. char_traits::lt(), compare(), and memcmp()
    Section: 21.1.3.1  [lib.char.traits.specializations.char]  Status: Review  Submitter: Martin Sebor  Date: 28 Jun 2004
    
+
    467. char_traits::lt(), compare(), and memcmp()
    Section: 21.1.3.1  [lib.char.traits.specializations.char]  Status: Review  Submitter: Martin Sebor  Date: 28 Jun 2004
    
 
 
    
 Table 37 describes the requirements on Traits::compare() in terms of
@@ -5438,7 +5441,7 @@ imposed by Table 37 on compare() when char is signed.
   Post-Redmond: Martin provided wording.]
    
 
 
    
-
    468. unexpected consequences of ios_base::operator void*()
    Section: 27.4.4.3  [lib.iostate.flags]  Status: Review  Submitter: Martin Sebor  Date: 28 Jun 2004
    
+
    468. unexpected consequences of ios_base::operator void*()
    Section: 27.4.4.3  [lib.iostate.flags]  Status: Review  Submitter: Martin Sebor  Date: 28 Jun 2004
    
 
 
    The program below is required to compile but when run it typically
 produces unexpected results due to the user-defined conversion from
@@ -5490,7 +5493,7 @@ the value need not be valid.
 
    [Redmond: 5-4 straw poll in favor of doing this.]
    
 
 
    
-
    469. vector<bool> ill-formed relational operators
    Section: 23.2.5  [lib.vector.bool]  Status: Ready  Submitter: Martin Sebor  Date: 28 Jun 2004
    
+
    469. vector<bool> ill-formed relational operators
    Section: 23.2.5  [lib.vector.bool]  Status: Ready  Submitter: Martin Sebor  Date: 28 Jun 2004
    
 
 
    
 The overloads of relational operators for vector<bool> specified
@@ -5506,7 +5509,7 @@ Remove all overloads of overloads of relational operators for
 vector<bool> from [lib.vector.bool].
 
    
 
    
-
    470. accessing containers from their elements' special functions
    Section: 23  [lib.containers]  Status: Open  Submitter: Martin Sebor  Date: 28 Jun 2004
    
+
    470. accessing containers from their elements' special functions
    Section: 23  [lib.containers]  Status: Open  Submitter: Martin Sebor  Date: 28 Jun 2004
    
 
 
    
 The standard doesn't prohibit the destructors (or any other special
@@ -5538,7 +5541,7 @@ in some surprising (i.e., undefined) behavior.
   
 
 
    
-
    471. result of what() implementation-defined
    Section: 18.6.1  [lib.exception]  Status: Open  Submitter: Martin Sebor  Date: 28 Jun 2004
    
+
    471. result of what() implementation-defined
    Section: 18.6.1  [lib.exception]  Status: Open  Submitter: Martin Sebor  Date: 28 Jun 2004
    
 
 
    [lib.exception] specifies the following:
    
 
        exception (const exception&) throw();
@@ -5577,12 +5580,12 @@ ctor was called).
 
 
    Proposed resolution:
    
 
    
-
    472. Missing "Returns" clause in std::equal_range
    Section: 25.3.3.3  [lib.equal.range]  Status: Review  Submitter: Prateek R Karandikar  Date: 29 Feb 1900
    
+
    472. Missing "Returns" clause in std::equal_range
    Section: 25.3.3.3  [lib.equal.range]  Status: Review  Submitter: Prateek R Karandikar  Date: 29 Feb 1900
    
 
    
 There is no "Returns:" clause for std::equal_range, which returns non-void.
 
    
 
    Proposed resolution:
    
-
    In 25.3.3.3  [lib.equal.range], change
    
+
    In 25.3.3.3  [lib.equal.range], change
    
 
    
   Effects: Finds the largest subrange [i, j)...
 
    
@@ -5591,7 +5594,7 @@ There is no "Returns:" clause for std::equal_range, which returns non-void.
   Returns: The largest subrange [i, j)...
 
    
 
    
-
    473. underspecified ctype calls
    Section: 22.2.1.1  [lib.locale.ctype]  Status: New  Submitter: Martin Sebor  Date: 1 Jul 2004
    
+
    473. underspecified ctype calls
    Section: 22.2.1.1  [lib.locale.ctype]  Status: New  Submitter: Martin Sebor  Date: 1 Jul 2004
    
 
    
 Most ctype member functions come in two forms: one that operates
 on a single character at a time and another form that operates
@@ -5686,7 +5689,7 @@ p2, with the following text:
-

474. confusing Footnote 297

Section: 27.6.2.5.4 [lib.ostream.inserters.character]  Status: New  Submitter: Martin Sebor  Date: 1 Jul 2004

+

474. confusing Footnote 297

Section: 27.6.2.5.4 [lib.ostream.inserters.character]  Status: New  Submitter: Martin Sebor  Date: 1 Jul 2004

I think Footnote 297 is confused. The paragraph it applies to seems @@ -5699,7 +5702,7 @@ value of widen(c) is otherwise. I propose to strike the Footnote.

-

475. May the function object passed to for_each modify the elements of the iterated sequence?

Section: 25.1.1 [lib.alg.foreach]  Status: New  Submitter: Stephan T. Lavavej, Jaakko Jarvi  Date: 9 Jul 2004

+

475. May the function object passed to for_each modify the elements of the iterated sequence?

Section: 25.1.1 [lib.alg.foreach]  Status: New  Submitter: Stephan T. Lavavej, Jaakko Jarvi  Date: 9 Jul 2004

It is not clear whether the function object passed to for_each is allowed to modify the elements of the sequence being iterated over. @@ -5758,7 +5761,7 @@ We suggest that the standard be clarified to explicitly allow the function objec passed to for_each modify its argument.

Proposed resolution:

-

Add the following sentence to the Effects in 25.1.1 [lib.alg.foreach]:

+

Add the following sentence to the Effects in 25.1.1 [lib.alg.foreach]:

"f may apply non-constant functions through the dereferenced iterators @@ -5767,7 +5770,7 @@ of a mutable iterator (24.1)."
-

476. Forward Iterator implied mutability

Section: 24.1.3 [lib.forward.iterators]  Status: New  Submitter: Dave Abrahams  Date: 9 Jul 2004

+

476. Forward Iterator implied mutability

Section: 24.1.3 [lib.forward.iterators]  Status: New  Submitter: Dave Abrahams  Date: 9 Jul 2004

24.1/3 says:

@@ -5796,7 +5799,7 @@ relationship between forward iterator and output iterator. requirements.
-

477. Operator-> for const forward iterators

Section: 24.1.3 [lib.forward.iterators]  Status: New  Submitter: Dave Abrahams  Date: 11 Jul 2004

+

477. Operator-> for const forward iterators

Section: 24.1.3 [lib.forward.iterators]  Status: New  Submitter: Dave Abrahams  Date: 11 Jul 2004

The Forward Iterator requirements table contains the following:

@@ -5826,10 +5829,10 @@ of referenced members. But Paragraph 11 of [lib.iterator.requirements] says:

AFAICT if we need the second line at all, it should read the same as the first line.

-

Related issue: 478

+

Related issue: 478

Proposed resolution:

-

478. Should forward iterator requirements table have a line for r->m?

Section: 24.1.3 [lib.forward.iterators]  Status: New  Submitter: Dave Abrahams  Date: 11 Jul 2004

+

478. Should forward iterator requirements table have a line for r->m?

Section: 24.1.3 [lib.forward.iterators]  Status: New  Submitter: Dave Abrahams  Date: 11 Jul 2004

The Forward Iterator requirements table contains the following:

@@ -5873,10 +5876,10 @@ answer is to change

in paragraph 11 of [lib.iterator.requirements].

-

Related issue: 477

+

Related issue: 477

Proposed resolution:

-

479. Container requirements and placement new

Section: 23.1 [lib.container.requirements]  Status: New  Submitter: Herb Sutter  Date: 1 Aug 2004

+

479. Container requirements and placement new

Section: 23.1 [lib.container.requirements]  Status: New  Submitter: Herb Sutter  Date: 1 Aug 2004

Nothing in the standard appears to make this program ill-formed:

  struct C {
@@ -5896,7 +5899,7 @@ answer is to change
 
 
Proposed resolution:

 

-
480. unary_function and binary_function should have protected nonvirtual destructors
Section: 20.3.1  [lib.base]  Status: New  Submitter: Joe Gottman  Date: 19 Aug 2004

+
480. unary_function and binary_function should have protected nonvirtual destructors
Section: 20.3.1  [lib.base]  Status: New  Submitter: Joe Gottman  Date: 19 Aug 2004

 
The classes std::unary_function and std::binary_function are both
 designed to be inherited from but contain no virtual functions.  This
 makes it too easy for a novice programmer to write code like
@@ -5944,7 +5947,7 @@ nonvirtual destructors.

     };
-

481. unique's effects on the range [result, last)

Section: 25.2.8 [lib.alg.unique]  Status: New  Submitter: Andrew Koenig  Date: 30 Aug 2004

+

481. unique's effects on the range [result, last)

Section: 25.2.8 [lib.alg.unique]  Status: New  Submitter: Andrew Koenig  Date: 30 Aug 2004

The standard says that unique(first, last) "eliminates all but the first element from every consecutive group of equal elements" in @@ -5963,7 +5966,7 @@ last) except that duplicates have been eliminated.

-

482. Swapping pairs

Section: 20.2.2 [lib.pairs], 25.2.2 [lib.alg.swap]  Status: New  Submitter: Andrew Koenig  Date: 14 Sep 2004

+

482. Swapping pairs

Section: 20.2.2 [lib.pairs], 25.2.2 [lib.alg.swap]  Status: New  Submitter: Andrew Koenig  Date: 14 Sep 2004

(Based on recent comp.std.c++ discussion)

Pair (and tuple) should specialize std::swap to work in terms of @@ -5972,99 +5975,7 @@ why swapping two objects of type pair<vector<int>, list<double> > should not take O(1).

Proposed resolution:

-

483. Heterogeneous equality and EqualityComparable

Section: 25.1 [lib.alg.nonmodifying], 25.2 [lib.alg.modifying.operations]  Status: New  Submitter: Peter Dimov  Date: 20 Sep 2004

-

c++std-lib-14262

- -

[lib.alg.find] requires T to be EqualityComparable:

- -
template <class InputIterator, class T>
-   InputIterator find(InputIterator first, InputIterator last,
-                      const T& value);
-
- -

-However the condition being tested, as specified in the Effects -clause, is actually *i == value, where i is an InputIterator. -

- -

-The two clauses are in agreement only if the type of *i is T, but this -isn't necessarily the case. *i may have a heterogeneous comparison -operator that takes a T, or a T may be convertible to the type of *i. -

- -

Further discussion (c++std-lib-14264): this problem affects a - number of algorithsm in clause 25, not just find. We - should try to resolve this problem everywhere it appears.

-

Proposed resolution:

- -

[lib.alg.find]:

-
- Remove [lib.alg.find]/1. -
- -

[lib.alg.count]:

-
- Remove [lib.alg.count]/1. -
- -

[lib.alg.search]:

-
- Remove "Type T is EqualityComparable (20.1.1), " from [lib.alg.search]/4. -
- -

[lib.alg.replace]:

- -
-

- Remove [lib.alg.replace]/1. - Replace [lb.alg.replace]/2 with: -

- -
- For every iterator i in the range [first, last) for which *i == value - or pred(*i) holds perform *i = new_value. -
- -

- Remove the first sentence of /4. - Replace the beginning of /5 with: -

- -
- For every iterator i in the range [result, result + (last - - first)), assign to *i either... -
- -

(Note the defect here, current text says assign to i, not *i).

-
- -

[lib.alg.fill]:

- -
-

- Remove "Type T is Assignable (23.1), " from /1. - Replace /2 with: -

- -
- For every iterator i in the range [first, last) or [first, first + n), - perform *i = value. -
-
- -

[lib.alg.remove]:

-
- Remove /1. - Remove the first sentence of /6. -
- -

Rationale:

-

Specifying EqualityComparable is redundant where it's correct, - because the equality requirements are implicit in the descriptions - of the algorithms' behavior.

-
-

484. Convertible to T

Section: 24.1.1 [lib.input.iterators]  Status: New  Submitter: Chris  Date: 16 Sep 2004

+

484. Convertible to T

Section: 24.1.1 [lib.input.iterators]  Status: New  Submitter: Chris  Date: 16 Sep 2004

From comp.std.c++:

@@ -6106,7 +6017,7 @@ class I expect?

-

485. output iterator insufficently constrained

Section: 24.1.2 [lib.output.iterators]  Status: New  Submitter: Chris  Date: 13 Oct 2004

+

485. output iterator insufficently constrained

Section: 24.1.2 [lib.output.iterators]  Status: New  Submitter: Chris  Date: 13 Oct 2004

The note on 24.1.2 Output iterators insufficently limits what can be performed on output iterators. While it requires that each iterator is @@ -6148,13 +6059,7 @@ to instead allow something more along the lines of:

are generated. With the exception of '*r++=t', an iterator must always be assigned to before it is incremented".

-

486. min/max CopyConstructible requirement is too strict

Section: 25.3.7 [lib.alg.min.max]  Status: New  Submitter: Dave Abrahams  Date: 13 Oct 2004

-

A straightforward implementation of these algorithms does not need to -copy T.

-

Proposed resolution:

-

drop the the words "and CopyConstructible" from paragraphs 1 and 4

-
-

487. Allocator::construct is too limiting

Section: 20.1.5 [lib.allocator.requirements]  Status: New  Submitter: Dhruv Matani  Date: 17 Oct 2004

+

487. Allocator::construct is too limiting

Section: 20.1.5 [lib.allocator.requirements]  Status: New  Submitter: Dhruv Matani  Date: 17 Oct 2004

The standard's version of allocator::construct(pointer, const_reference) severely limits what you can construct using this @@ -6177,6 +6082,911 @@ allocator::construct(), making it: Now, the ctor of the class T which matches the one that takes a T1 can be called! Doesn't that sound great?

+

Proposed resolution:

+

+

+
+

488. rotate throws away useful information

Section: 25.2.10 [lib.alg.rotate]  Status: New  Submitter: Howard Hinnant  Date: 22 Nov 2004

+

+rotate takes 3 iterators: first, middle and last which point into a +sequence, and rearranges the sequence such that the subrange [middle, +last) is now at the beginning of the sequence and the subrange [first, +middle) follows. The return type is void. +

+ +

+In many use cases of rotate, the client needs to know where the +subrange [first, middle) starts after the rotate is performed. This +might look like: +

+
  rotate(first, middle, last);
+  Iterator i = advance(first, distance(middle, last));
+
+ +

+Unless the iterators are random access, the computation to find the +start of the subrange [first, middle) has linear complexity. However, +it is not difficult for rotate to return this information with +negligible additional computation expense. So the client could code: +

+
  Iterator i = rotate(first, middle, last);
+
+ +

+and the resulting program becomes significantly more efficient. +

+ +

+While the backwards compatibility hit with this change is not zero, it +is very small (similar to that of lwg ), and there is +a significant benefit to the change. +

+ +

Proposed resolution:

+

In 25p2, change:

+
  template<class ForwardIterator>
+    void rotate(ForwardIterator first, ForwardIterator middle,
+                ForwardIterator last);
+
+ +

to:

+ +
  template<class ForwardIterator>
+    ForwardIterator rotate(ForwardIterator first, ForwardIterator middle,
+                           ForwardIterator last);
+
+ +

In 25.2.10, change:

+ +
  template<class ForwardIterator>
+    void rotate(ForwardIterator first, ForwardIterator middle,
+                ForwardIterator last);
+
+ +

to:

+ +
  template<class ForwardIterator>
+    ForwardIterator rotate(ForwardIterator first, ForwardIterator middle,
+                           ForwardIterator last);
+
+ +

In 25.2.10 insert a new paragraph after p1:

+ +
+

Returns: advance(first, distance(middle, last)).

+
+
+

489. std::remove / std::remove_if wrongly specified

Section: 25.2.7 [lib.alg.remove]  Status: New  Submitter: Thomas Mang  Date: 12 Dec 2004

+

In Section 25.2.7 [lib.alg.remove], paragraphs 1 to 5 describe the +behavior of the mutating sequence operations std::remove and +std::remove_if. However, the wording does not reflect the intended +behavior [Note: See definition of intended behavior below] of these +algorithms, as it is known to the C++ community [1]. +

+ + + +

1) Analysis of current wording:

+ + +

25.2.7 [lib.alg.remove], paragraph 2:

+ +

Current wording says: +"Effects: Eliminates all the elements referred to by iterator i in the +range [first, last) for which the following corresponding conditions +hold: *i == value, pred(*i) != false."

+ +

+This sentences expresses specifically that all elements denoted by the +(original) range [first, last) for which the corresponding condition +hold will be eliminated. Since there is no formal definition of the term +"eliminate" provided, the meaning of "eliminate" in everyday language +implies that as postcondition, no element in the range denoted by +[first, last) will hold the corresponding condition on reiteration over +the range [first, last). +

+ +

+However, this is neither the intent [Note: See definition of intended +behavior below] nor a general possible approach. It can be easily proven +that if all elements of the original range[first, last) will hold the +condition, it is not possible to substitute them by an element for which +the condition will not hold. +

+ + +

25.2.7 [lib.alg.remove], paragraph 3:

+ +

+Current wording says: +"Returns: The end of the resulting range." +

+ +

+The resulting range is not specified. In combination with 25.2.7 +[lib.alg.remove], paragraph 2, the only reasonable interpretation of +this so-called resulting range is the range [first,last) - thus +returning always the ForwardIterator 'last' parameter. +

+ + +

+25.2.7 [lib.alg.remove], paragraph 4: +

+ +

+Current wording says: +"Notes: Stable: the relative order of the elements that are not removed +is the same as their relative order in the original range" +

+ +

+This sentences makes use of the term "removed", which is neither +specified, nor used in a previous paragraph (which uses the term +"eliminate"), nor unamgiuously separated from the name of the algorithm. +

+ + +

2) Description of intended behavior:

+ +

+For the rest of this Defect Report, it is assumed that the intended +behavior was that all elements of the range [first, last) which do not +hold the condition *i == value (std::remove) or pred(*i) != false +(std::remove_if)], call them s-elements [Note: s...stay], will be placed +into a contiguous subrange of [first, last), denoted by the iterators +[first, return value). The number of elements in the resulting range +[first, return value) shall be equal to the number of s-elements in the +original range [first, last). The relative order of the elements in the +resulting subrange[first, return value) shall be the same as the +relative order of the corresponding elements in the original range. It +is undefined whether any elements in the resulting subrange [return +value, last) will hold the corresponding condition, or not. +

+ +

+All implementations known to the author of this Defect Report comply +with this intent. Since the intent of the behavior (contrary to the +current wording) is also described in various utility references serving +the C++ community [1], it is not expected that fixing the paragraphs +will influence current code - unless the code relies on the behavior as +it is described by current wording and the implementation indeed +reflects the current wording, and not the intent. +

+ + + +

3) Proposed fixes:

+ + +

Change 25.2.7 [lib.alg.remove], paragraph 2 to:

+ +

+"Effect: Places all the elements referred to by iterator i in the range +[first, last) for which the following corresponding conditions hold : +!(*i == value), pred(*i) == false into the subrange [first, k) of the +original range, where k shall denote a value of type ForwardIterator. It +is undefined whether any elements in the resulting subrange [k, last) +will hold the corresponding condition, or not." +

+ +

Comments to the new wording:

+ +

+a) "Places" has no special meaning, and the everyday language meaning +should fit. +b) The corresponding conditions were negated compared to the current +wording, becaue the new wording requires it. +c) The wording "of the original range" might be redundant, since any +subrange starting at 'first' and containing no more elements than the +original range is implicitly a subrange of the original range [first, +last). +d) The iterator k was introduced instead of "return value" in order to +avoid a cyclic dependency on 25.2.7/3. The wording ", where k shall +denote a value of type ForwardIterator" might be redundant, because it +follows implicitly by 25.2.7/3. +e) "Places" does, in the author's opinion, explicitly forbid duplicating +any element holding the corresponding condition in the original range +[first, last) within the resulting range [first, k). If there is doubt +this term might be not unambiguous regarding this, it is suggested that +k is specified more closely by the following wording: "k shall denote a +value of type ForwardIterator [Note: see d)] so that k - first is equal +to the number of elements in the original range [first, last) for which +the corresponding condition did hold". This could also be expressed as a +separate paragraph "Postcondition:" +f) The senctence "It is undefined whether any elements in the resulting +subrange [k, last) will hold the corresponding condition, or not." was +added consciously so the term "Places" does not imply if the original +range [first, last) contains n elements holding the corresponding +condition, the identical range[first, last) will also contain exactly n +elements holding the corresponding condition after application of the +algorithm. +

+ +

+Change 25.2.7 [lib.alg.remove], paragraph 3 to: + +"Returns: The iterator k." +

+ +

+Change 25.2.7 [lib.alg.remove], paragraph 4 to: + +"Notes: Stable: the relative order of the elements that are placed into +the subrange [first, return value) shall be the same as their relative +order was in the original range [first, last) prior to application of +the algorithm." +

+ +

+Comments to the new wording: +

+ +

+a) the wording "was ... prior to application of the algorithm" is used +to explicitly distinguish the original range not only by means of +iterators, but also by a 'chronological' factor from the resulting range +[first, return value). It might be redundant. +

+ +

+[1]: +The wording of these references is not always unambiguous, and provided +examples partially contradict verbal description of the algorithms, +because the verbal description resembles the problematic wording of +ISO/IEC 14882:2003. +

+

Proposed resolution:

+

+

+
+

490. std::unique wrongly specified

Section: 25.2.8 [lib.alg.unique]  Status: New  Submitter: Thomas Mang  Date: 12 Dec 2004

+

In Section 25.2.8 [lib.alg.unique], paragraphs 1 to 3 describe the +behavior of the mutating sequence operation std::unique. However, the +wording does not reflect the intended behavior [Note: See definition of +intended behavior below] of these algorithms, as it is known to the C++ +community [1].

+ + + +

1) Analysis of current wording:

+ + +

25.2.8 [lib.alg.unique], paragraph 1:

+ +

+Current wording says: +"Effects: Eliminates all but the first element from every consecutive +group of equal elements referred to by the iterator i in the range +[first, last) for which the following corresponding conditions hold: *i +== *(i - 1) or pred(*i, *(i -1)) != false" +

+ +

+This sentences expresses specifically that all elements denoted by the +(original) range [first, last) which are not but the first element from +a consecutive group of equal elements (where equality is defined as *i +== *(i - 1) or pred(*i, *(i - 1)) ! = false) [Note: See DR 202], call +them r-elements [Note: r...remove], will be eliminated. Since there is +no formal definition of the term "eliminate" provided, it is undefined +how this "elimination" takes place. But the meaning of "eliminate" in +everyday language seems to disallow explicitly that after application of +the algorithm, any r-element will remain at any position of the range +[first, last) [2]. +

+ +

+Another defect in the current wording concerns the iterators used to +compare two elements for equality: The current wording contains the +expression "(i - 1)", which is not covered by 25/9 [Note: See DR +submitted by Thomas Mang regarding invalid iterator arithmetic +expressions]. +

+ + +

+25.2.8 [lib.alg.unique], paragraph 2: +

+

Current wording says: +"Returns: The end of the resulting range."

+ +

+The resulting range is not specified. In combination with 25.2.8 +[lib.alg.unique], paragraph 1, one reasonable interpretation (in the +author's opinion even the only possible interpretation) of this +so-called resulting range is the range [first, last) - thus returning +always the ForwardIterator 'last' parameter. +

+ +

2) Description of intended behavior:

+ +

+For the rest of this Defect Report, it is assumed that the intended +behavior was that all elements denoted by the original range [first, +last) which are the first element from a consecutive group of elements +for which the corresponding conditions: *(i-1) == *i (for the version of +unique without a predicate argument) or pred(*(i-1), *i) ! = false (for +the version of unique with a predicate argument) [Note: If such a group +of elements consists of only a single element, this is also considered +the first element] [Note: See resolutions of DR 202], call them +s-elements [Note: s...stay], will be placed into a contiguous subrange +of [first, last), denoted by the iterators [first, return value). The +number of elements in the resulting range [first, return value) shall be +equal to the number of s-elements in the original range [first, last). +Invalid iterator arithmetic expressions are expected to be resolved as +proposed in DR submitted by Thomas Mang regarding invalid iterator +arithmetic expressions. It is also assumed by the author that the +relative order of the elements in the resulting subrange [first, return +value) shall be the same as the relative order of the corresponding +elements (the s-elements) in the original range [Note: If this was not +intended behavior, the additional proposed paragraph about stable order +will certainly become obsolete]. +Furthermore, the resolutions of DR 202 are partially considered. +

+ +

+All implementations known to the author of this Defect Report comply +with this intent [Note: Except possible effects of DR 202]. Since this +intent of the behavior (contrary to the current wording) is also +described in various utility references serving the C++ community [1], +it is not expected that fixing the paragraphs will influence current +code [Note: Except possible effects of DR 202] - unless the code relies +on the behavior as it is described by current wording and the +implementation indeed reflects the current wording, and not the intent. +

+ + + +

3) Proposed fixes:

+ +

+Change 25.2.8 [lib.alg.unique], paragraph 1 to: +

+ +

+"Effect: Places the first element from every consecutive group of +elements, referred to by the iterator i in the range [first, last), for +which the following conditions hold: *(i-1) == *i (for the version of +unique without a predicate argument) or pred(*(i -1), *i) != false (for +the version of unique with a predicate argument), into the subrange +[first, k) of the original range, where k shall denote a value of type +ForwardIterator." +

+ +

Comments to the new wording:

+ +

+a) The new wording was influenced by the resolutions of DR 202. If DR +202 is resolved in another way, the proposed wording need also +additional review. +b) "Places" has no special meaning, and the everyday language meaning +should fit. +c) The expression "(i - 1)" was left, but is expected that DR submitted +by Thomas Mang regarding invalid iterator arithmetic expressions will +take this into account. +d) The wording "(for the version of unique without a predicate +argument)" and "(for the version of unique with a predicate argument)" +was added consciously for clarity and is in resemblence with current +23.2.2.4 [lib.list.ops], paragraph 19. It might be considered redundant. +e) The wording "of the original range" might be redundant, since any +subrange starting at first and containing no more elements than the +original range is implicitly a subrange of the original range [first, +last). +f) The iterator k was introduced instead of "return value" in order to +avoid a cyclic dependency on 25.2.8 [lib.alg.unique], paragraph 2. The +wording ", where k shall denote a value of type ForwardIterator" might +be redundant, because it follows implicitly by 25.2.8 [lib.alg.unique], +paragraph 2. +g) "Places" does, in the author's opinion, explicitly forbid duplicating +any s-element in the original range [first, last) within the resulting +range [first, k). If there is doubt this term might be not unambiguous +regarding this, it is suggested that k is specified more closely by the +following wording: "k shall denote a value of type ForwardIterator +[Note: See f)] so that k - first is equal to the number of elements in +the original range [first, last) being the first element from every +consecutive group of elements for which the corresponding condition did +hold". This could also be expressed as a separate paragraph +"Postcondition:". +h) If it is considered that the wording is unclear whether it declares +the element of a group which consists of only a single element +implicitly to be the first element of this group [Note: Such an +interpretation could eventually arise especially in case last - first == +1] , the following additional sentence is proposed: "If such a group of +elements consists of only a single element, this element is also +considered the first element." +

+ +

+Change 25.2.8 [lib.alg.unique], paragraph 2 to: +"Returns: The iterator k." +

+ +

+Add a separate paragraph "Notes:" as 25.2.8 [lib.alg.unique], paragraph +2a or 3a, or a separate paragraph "Postcondition:" before 25.2.8 +[lib.alg.unique], paragraph 2 (wording inside {} shall be eliminated if +the preceding expressions are used, or the preceding expressions shall +be eliminated if wording inside {} is used): +

+ +

+"Notes:{Postcondition:} Stable: the relative order of the elements that +are placed into the subrange [first, return value {k}) shall be the same +as their relative order was in the original range [first, last) prior to +application of the algorithm." +

+ +

Comments to the new wording:

+ +

+a) It is assumed by the author that the algorithm was intended to be +stable. +In case this was not the intent, this paragraph becomes certainly +obsolete. +b) The wording "was ... prior to application of the algorithm" is used +to explicitly distinguish the original range not only by means of +iterators, but also by a 'chronological' factor from the resulting range +[first, return value). It might be redundant. +

+ +

+25.2.8 [lib.alg.unique], paragraph 3: +

+

See DR 239.

+ +

+4) References to other DRs: +

+ +

+See DR 202, but which does not address any of the problems described in +this Defect Report [Note: This DR is supposed to complement DR 202]. +See DR 239. +See DR submitted by Thomas Mang regarding invalid iterator arithmetic +expressions. +

+ +

+[1]: +The wording of these references is not always unambiguous, and provided +examples partially contradict verbal description of the algorithms, +because the verbal description resembles the problematic wording of +ISO/IEC 14882:2003. +

+ +

+[2]: +Illustration of conforming implementations according to current wording: +

+ +

+One way the author of this DR considers how this "elimination" could be +achieved by a conforming implementation according to current wording is +by substituting each r-element by _any_ s-element [Note: s...stay; any +non-r-element], since all r-elements are "eliminated". +

+ +

+In case of a sequence consisting of elements being all 'equal' [Note: +See DR 202], substituting each r-element by the single s-element is the +only possible solution according to current wording. +

+

Proposed resolution:

+

+

+
+

491. std::list<>::unique incorrectly specified

Section: 23.2.2.4 [lib.list.ops]  Status: New  Submitter: Thomas Mang  Date: 12 Dec 2004

+

In Section 23.2.2.4 [lib.list.ops], paragraphs 19 to 21 describe the +behavior of the std::list<T, Allocator>::unique operation. However, the +current wording is defective for various reasons.

+ + + +

+1) Analysis of current wording: +

+ +

23.2.2.4 [lib.list.ops], paragraph 19:

+ +

+Current wording says: +"Effects: Eliminates all but the first element from every consecutive +group of equal elements referred to by the iterator i in the range +[first + 1, last) for which *i == *(i - 1) (for the version of unique +with no argument) or pred(*i, *(i -1)) (for the version of unique with a +predicate argument) holds."

+ +

+This sentences makes use of the undefined term "Eliminates". Although it +is, to a certain degree, reasonable to consider the term "eliminate" +synonymous with "erase", using "Erase" in the first place, as the +wording of 23.2.2.4 [lib.list.ops], paragraph 15 does, would be clearer.

+ +

+The range of the elements referred to by iterator i is "[first + 1, +last)". However, neither "first" nor "last" is defined.

+ +

+The sentence makes three times use of iterator arithmetic expressions ( +"first + 1", "*i == *(i - 1)", "pred(*i, *(i -1))" ) which is not +defined for bidirectional iterator [see DR submitted by Thomas Mang +regarding invalid iterator arithmetic expressions].

+ +

+The same problems as pointed out in DR 202 (equivalence relation / order +of arguments for pred()) apply to this paragraph.

+ +

+23.2.2.4 [lib.list.ops], paragraph 20: +

+ +

+Current wording says: +"Throws: Nothing unless an exception in thrown by *i == *(i-1) or +pred(*i, *(i - 1))"

+ +

+The sentence makes two times use of invalid iterator arithmetic +expressions ( "*i == *(i - 1)", "pred(*i, *(i -1))" ). +

+

+[Note: Minor typos: "in" / missing dot at end of sentence.] +

+ +

+23.2.2.4 [lib.list.ops], paragraph 21:

+ +

+Current wording says: +"Complexity: If the range (last - first) is not empty, exactly (last - +first) - 1 applications of the corresponding predicate, otherwise no +application of the predicate.

+ +

+See DR 315 regarding "(last - first)" not yielding a range.

+ +

+Invalid iterator arithmetic expression "(last - first) - 1" left .

+ + +

2) Description of intended behavior:

+ +

+For the rest of this Defect Report, it is assumed that "eliminate" is +supposed to be synonymous to "erase", that "first" is equivalent to an +iterator obtained by a call to begin(), "last" is equivalent to an +iterator obtained by a call to end(), and that all invalid iterator +arithmetic expressions are resolved as described in DR submitted by +Thomas Mang regarding invalid iterator arithmetic expressions.

+ +

+Furthermore, the resolutions of DR 202 are considered regarding +equivalence relation and order of arguments for a call to pred.

+ +

+All implementations known to the author of this Defect Report comply +with these assumptions, apart from the impact of the alternative +resolution of DR 202. Except for the changes implied by the resolutions +of DR 202, no impact on current code is expected.

+ +

+3) Proposed fixes:

+ +

+Change 23.2.2.4 [lib.list.ops], paragraph 19 to:

+ +

+"Effect: Erases all but the first element from every consecutive group +of elements, referred to by the iterator i in the range [begin(), +end()), for which the following conditions hold: *(i-1) == *i (for the +version of unique with no argument) or pred(*(i-1), *i) != false (for +the version of unique with a predicate argument)."

+ +

+Comments to the new wording:

+ +

+a) The new wording was influenced by DR 202 and the resolutions +presented there. If DR 202 is resolved in another way, the proposed +wording need also additional review. +b) "Erases" refers in the author's opinion unambiguously to the member +function "erase". In case there is doubt this might not be unamgibuous, +a direct reference to the member function "erase" is suggested [Note: +This would also imply a change of 23.2.2.4 [lib.list.ops], paragraph +15.]. +c) The expression "(i - 1)" was left, but is expected that DR submitted +by Thomas Mang regarding invalid iterator arithmetic expressions will +take this into account. +d) The wording "(for the version of unique with no argument)" and "(for +the version of unique with a predicate argument)" was kept consciously +for clarity. +e) "begin()" substitutes "first", and "end()" substitutes "last". The +range need adjustment from "[first + 1, last)" to "[begin(), end())" to +ensure a valid range in case of an empty list. +f) If it is considered that the wording is unclear whether it declares +the element of a group which consists of only a single element +implicitly to be the first element of this group [Note: Such an +interpretation could eventually arise especially in case size() == 1] , +the following additional sentence is proposed: "If such a group of +elements consists of only a single element, this element is also +considered the first element."

+ +

+Change 23.2.2.4 [lib.list.ops], paragraph 20 to:

+ +

+"Throws: Nothing unless an exception is thrown by *(i-1) == *i or +pred(*(i-1), *i)."

+ +

+Comments to the new wording:

+ +

+a) The wording regarding the conditions is identical to proposed +23.2.2.4 [lib.list.ops], paragraph 19. If 23.2.2.4 [lib.list.ops], +paragraph 19 is resolved in another way, the proposed wording need also +additional review. +b) The expression "(i - 1)" was left, but is expected that DR submitted +by Thomas Mang regarding invalid iterator arithmetic expressions will +take this into account. +c) Typos fixed.

+ +

+Change 23.2.2.4 [lib.list.ops], paragraph 21 to:

+ +

+"Complexity: If empty() == false, exactly size() - 1 applications of the +corresponding predicate, otherwise no applications of the corresponding +predicate."

+ +

+Comments to the new wording:

+ +

+a) The new wording is supposed to also replace the proposed resolution +of DR 315, which suffers from the problem of undefined "first" / "last". +

+ +

+5) References to other DRs:

+ +

See DR 202. +See DR 239. +See DR 315. +See DR submitted by Thomas Mang regarding invalid iterator arithmetic +expressions.

+ +

Proposed resolution:

+

+

+
+

492. Invalid iterator arithmetic expressions

Section: 23 [lib.containers], 24 [lib.iterators], 25 [lib.algorithms]  Status: New  Submitter: Thomas Mang  Date: 12 Dec 2004

+

Various clauses other than clause 25 make use of iterator arithmetic not +supported by the iterator category in question. +Algorithms in clause 25 are exceptional because of 25 [lib.algorithms], +paragraph 9, but this paragraph does not provide semantics to the +expression "iterator - n", where n denotes a value of a distance type +between iterators.

+ +

1) Examples of current wording:

+ +

Current wording outside clause 25:

+ +

+23.2.2.4 [lib.list.ops], paragraphs 19-21: "first + 1", "(i - 1)", +"(last - first)" +23.3.1.1 [lib.map.cons], paragraph 4: "last - first" +23.3.2.1 [lib.multimap.cons], paragraph 4: "last - first" +23.3.3.1 [lib.set.cons], paragraph 4: "last - first" +23.3.4.1 [lib.multiset.cons], paragraph 4: "last - first" +24.4.1 [lib.reverse.iterators], paragraph 1: "(i - 1)" +

+ +

+[Important note: The list is not complete, just an illustration. The +same issue might well apply to other paragraphs not listed here.]

+ +

None of these expressions is valid for the corresponding iterator +category.

+ +

Current wording in clause 25:

+ +

+25.1.1 [lib.alg.foreach], paragraph 1: "last - 1" +25.1.3 [lib.alg.find.end], paragraph 2: "[first1, last1 - +(last2-first2))" +25.2.8 [lib.alg.unique], paragraph 1: "(i - 1)" +25.2.8 [lib.alg.unique], paragraph 5: "(i - 1)" +

+ +

+However, current wording of 25 [lib.algorithms], paragraph 9 covers +neither of these four cases:

+ +

Current wording of 25 [lib.algorithms], paragraph 9:

+ +

+"In the description of the algorithms operator + and - are used for some +of the iterator categories for which they do not have to be defined. In +these cases the semantics of a+n is the same as that of

+
{X tmp = a;
+advance(tmp, n);
+return tmp;
+}
+
+

and that of b-a is the same as of return distance(a, b)"

+ +

+This paragrpah does not take the expression "iterator - n" into account, +where n denotes a value of a distance type between two iterators [Note: +According to current wording, the expression "iterator - n" would be +resolved as equivalent to "return distance(n, iterator)"]. Even if the +expression "iterator - n" were to be reinterpreted as equivalent to +"iterator + -n" [Note: This would imply that "a" and "b" were +interpreted implicitly as values of iterator types, and "n" as value of +a distance type], then 24.3.4/2 interfers because it says: "Requires: n +may be negative only for random access and bidirectional iterators.", +and none of the paragraphs quoted above requires the iterators on which +the algorithms operate to be of random access or bidirectional category. +

+ +

2) Description of intended behavior:

+ +

+For the rest of this Defect Report, it is assumed that the expression +"iterator1 + n" and "iterator1 - iterator2" has the semantics as +described in current 25 [lib.algorithms], paragraph 9, but applying to +all clauses. The expression "iterator1 - n" is equivalent to an +result-iterator for which the expression "result-iterator + n" yields an +iterator denoting the same position as iterator1 does. The terms +"iterator1", "iterator2" and "result-iterator" shall denote the value of +an iterator type, and the term "n" shall denote a value of a distance +type between two iterators.

+ +

+All implementations known to the author of this Defect Report comply +with these assumptions. +No impact on current code is expected.

+ +

3) Proposed fixes:

+ + +

Change 25 [lib.algorithms], paragraph 9 to:

+ +

+"In the description of the algorithms operator + and - are used for some +of the iterator categories for which they do not have to be defined. In +this paragraph, a and b denote values of an iterator type, and n denotes +a value of a distance type between two iterators. In these cases the +semantics of a+n is the same as that of

+
{X tmp = a;
+advance(tmp, n);
+return tmp;
+}
+
+

,the semantics of a-n denotes the value of an iterator i for which the +following condition holds: +advance(i, n) == a, +and that of b-a is the same as of +return distance(a, b)". +

+ +

Comments to the new wording:

+ +

+a) The wording " In this paragraph, a and b denote values of an iterator +type, and n denotes a value of a distance type between two iterators." +was added so the expressions "b-a" and "a-n" are distinguished regarding +the types of the values on which they operate. +b) The wording ",the semantics of a-n denotes the value of an iterator i +for which the following condition holds: advance(i, n) == a" was added +to cover the expression 'iterator - n'. The wording "advance(i, n) == a" +was used to avoid a dependency on the semantics of a+n, as the wording +"i + n == a" would have implied. However, such a dependency might well +be deserved. +c) DR 225 is not considered in the new wording. +

+ +

+Proposed fixes regarding invalid iterator arithmetic expressions outside +clause 25:

+ +

+Either +a) Move modified 25 [lib.algorithms], paragraph 9 (as proposed above) +before any current invalid iterator arithmetic expression. In that case, +the first sentence of 25 [lib.algorithms], paragraph 9, need also to be +modified and could read: "For the rest of this International Standard, +...." / "In the description of the following clauses including this +...." / "In the description of the text below ..." etc. - anyways +substituting the wording "algorithms", which is a straight reference to +clause 25. +In that case, 25 [lib.algorithms] paragraph 9 will certainly become +obsolete. +Alternatively, +b) Add an appropiate paragraph similar to resolved 25 [lib.algorithms], +paragraph 9, to the beginning of each clause containing invalid iterator +arithmetic expressions. +Alternatively, +c) Fix each paragraph (both current wording and possible resolutions of +DRs) containing invalid iterator arithmetic expressions separately. +

+ +

5) References to other DRs:

+ +

+See DR 225. +See DR 237. The resolution could then also read "Linear in last - +first". +

+

Proposed resolution:

+

+

+
+

493. Undefined Expression in Input Iterator Note Title

Section: 24.1.1 [lib.input.iterators]  Status: New  Submitter: Chris Jefferson  Date: 13 Dec 2004

+

1) In 24.1.1/3, the following text is currently present.

+ +

"Note: For input iterators, a==b does not imply ++a=++b (Equality does +not guarantee the substitution property or referential transparency)."

+ +

However, when in Table 72, part of the definition of ++r is given as:

+ +

"pre: r is dereferenceable. +post: any copies of the previous value of r are no longer required +either to be dereferenceable ..."

+ +

While a==b does not imply that b is a copy of a, this statement should +perhaps still be made more clear.

+ +

2) There are no changes to intended behaviour

+ +

+3) This Note should be altered to say "Note: For input iterators a==b, +when its behaviour is defined ++a==++b may still be false (Equality does +not guarantee the substitution property or referential transparency).

+ +

Proposed resolution:

+

+

+
+

494. Wrong runtime complexity for associative container's insert and delete

Section: 23.1.2 [lib.associative.reqmts]  Status: New  Submitter: Hans B os  Date: 19 Dec 2004

+

According to [lib.associative.reqmts] table 69, the runtime comlexity +of insert(p, t) and erase(q) can be done in amortized constant time.

+ +

It was my understanding that an associative container could be +implemented as a balanced binary tree.

+ +

For inser(p, t), you 'll have to iterate to p's next node to see if t +can be placed next to p. Furthermore, the insertion usually takes +place at leaf nodes. An insert next to the root node will be done at +the left of the root next node

+ +

So when p is the root node you 'll have to iterate from the root to +its next node, which takes O(log(size)) time in a balanced tree.

+ +

If you insert all values with insert(root, t) (where root is the +root of the tree before insertion) then each insert takes O(log(size)) +time. The amortized complexity per insertion will be O(log(size)) +also.

+ +

For erase(q), the normal algorithm for deleting a node that has no +empty left or right subtree, is to iterate to the next (or previous), +which is a leaf node. Then exchange the node with the next and delete +the leaf node. Furthermore according to DR 130, erase should return +the next node of the node erased. Thus erasing the root node, +requires iterating to the next node.

+ +

Now if you empty a map by deleting the root node until the map is +empty, each operation will take O(log(size)), and the amortized +complexity is still O(log(size)).

+ +

The operations can be done in amortized constant time if iterating +to the next node can be done in (non amortized) constant time. This +can be done by putting all nodes in a double linked list. This +requires two extra links per node. To me this is a bit overkill since +you can already efficiently insert or erase ranges with erase(first, +last) and insert(first, last).

+

Proposed resolution:

diff --git a/libstdc++-v3/docs/html/ext/lwg-defects.html b/libstdc++-v3/docs/html/ext/lwg-defects.html index 42f93f0f91b7..467a0e5db380 100644 --- a/libstdc++-v3/docs/html/ext/lwg-defects.html +++ b/libstdc++-v3/docs/html/ext/lwg-defects.html @@ -5,11 +5,11 @@ - + - + @@ -20,55 +20,58 @@
Doc. no.N1709=04-0149N1754=05-0014
Date:5 Nov 20042005-01-17
Project:Matt Austern <austern@apple.com>
-

C++ Standard Library Defect Report List (Revision 33)

+

C++ Standard Library Defect Report List (Revision 34)

Reference ISO/IEC IS 14882:1998(E)

Also see:

This document contains only library issues which have been closed by the Library Working Group (LWG) after being found to be defects - in the standard. That is, issues which have a status of DR, TC, or RR. See the - Library Closed Issues List for issues closed as non-defects. See the - Library Active Issues List for active issues and more information. The + in the standard. That is, issues which have a status of DR, TC, or RR. See the + Library Closed Issues List for issues closed as non-defects. See the + Library Active Issues List for active issues and more information. The introductory material in that document also applies to this document.

Revision History

    +
  • R34: +2005-01 mid-term mailing. Added new issues 488-494. +
  • R33: 2004-11 post-Redmond mailing. Reflections actions taken in Redmond.
  • R32: 2004-09 pre-Redmond mailing: reflects new proposed resolutions and new issues received after the 2004-07 mailing. Added -new issues 479-481. +new issues 479-481.
  • R31: 2004-07 mid-term mailing: reflects new proposed resolutions and new issues received after the post-Sydney mailing. Added -new issues 463-478. +new issues 463-478.
  • R30: Post-Sydney mailing: reflects decisions made at the Sydney meeting. Voted all "Ready" issues from R29 into the working paper. -Added new issues 460-462. +Added new issues 460-462.
  • R29: -Pre-Sydney mailing. Added new issues 441-457. +Pre-Sydney mailing. Added new issues 441-457.
  • R28: Post-Kona mailing: reflects decisions made at the Kona meeting. -Added new issues 432-440. +Added new issues 432-440.
  • R27: -Pre-Kona mailing. Added new issues 404-431. +Pre-Kona mailing. Added new issues 404-431.
  • R26: Post-Oxford mailing: reflects decisions made at the Oxford meeting. @@ -76,139 +79,139 @@ All issues in Ready status were voted into DR status. All issues in DR status were voted into WP status.
  • R25: -Pre-Oxford mailing. Added new issues 390-402. +Pre-Oxford mailing. Added new issues 390-402.
  • R24: Post-Santa Cruz mailing: reflects decisions made at the Santa Cruz -meeting. All Ready issues from R23 with the exception of 253, which has been given a new proposed resolution, were -moved to DR status. Added new issues 383-389. (Issues 387-389 were discussed -at the meeting.) Made progress on issues 225, 226, 229: 225 and 229 have been moved to Ready status, and the only remaining -concerns with 226 involve wording. +meeting. All Ready issues from R23 with the exception of 253, which has been given a new proposed resolution, were +moved to DR status. Added new issues 383-389. (Issues 387-389 were discussed +at the meeting.) Made progress on issues 225, 226, 229: 225 and 229 have been moved to Ready status, and the only remaining +concerns with 226 involve wording.
  • R23: -Pre-Santa Cruz mailing. Added new issues 367-382. +Pre-Santa Cruz mailing. Added new issues 367-382. Moved issues in the TC to TC status.
  • R22: -Post-Curaçao mailing. Added new issues 362-366. +Post-Curaçao mailing. Added new issues 362-366.
  • R21: -Pre-Curaçao mailing. Added new issues 351-361. +Pre-Curaçao mailing. Added new issues 351-361.
  • R20: Post-Redmond mailing; reflects actions taken in Redmond. Added -new issues 336-350, of which issues -347-350 were added since Redmond, hence +new issues 336-350, of which issues +347-350 were added since Redmond, hence not discussed at the meeting. All Ready issues were moved to DR status, with the exception of issues -284, 241, and 267. +284, 241, and 267. Noteworthy issues discussed at Redmond include -120 202, 226, 233, -270, 253, 254, 323. +120 202, 226, 233, +270, 253, 254, 323.
  • R19: Pre-Redmond mailing. Added new issues -323-335. +323-335.
  • R18: Post-Copenhagen mailing; reflects actions taken in Copenhagen. -Added new issues 312-317, and discussed -new issues 271-314. +Added new issues 312-317, and discussed +new issues 271-314. Changed status of issues -103 118 136 153 -165 171 183 184 -185 186 214 221 -234 237 243 248 -251 252 256 260 -261 262 263 265 -268 +103 118 136 153 +165 171 183 184 +185 186 214 221 +234 237 243 248 +251 252 256 260 +261 262 263 265 +268 to DR. Changed status of issues -49 109 117 182 -228 230 232 235 -238 241 242 250 -259 264 266 267 -271 272 273 275 -281 284 285 286 -288 292 295 297 -298 301 303 306 -307 308 312 +49 109 117 182 +228 230 232 235 +238 241 242 250 +259 264 266 267 +271 272 273 275 +281 284 285 286 +288 292 295 297 +298 301 303 306 +307 308 312 to Ready. Closed issues -111 277 279 287 -289 293 302 313 -314 +111 277 279 287 +289 293 302 313 +314 as NAD.
  • R17: Pre-Copenhagen mailing. Converted issues list to XML. Added proposed -resolutions for issues 49, 76, 91, 235, 250, 267. -Added new issues 278-311. +resolutions for issues 49, 76, 91, 235, 250, 267. +Added new issues 278-311.
  • R16: post-Toronto mailing; reflects actions taken in Toronto. Added new -issues 265-277. Changed status of issues -3, 8, 9, 19, -26, 31, 61, -63, 86, 108, -112, 114, 115, -122, 127, 129, -134, 137, 142, -144, 146, 147, -159, 164, 170, -181, 199, 208, -209, 210, 211, -212, 217, 220, -222, 223, 224, -227 to "DR". Reopened issue 23. Reopened -issue 187. Changed issues 2 and -4 to NAD. Fixed a typo in issue 17. Fixed -issue 70: signature should be changed both places it -appears. Fixed issue 160: previous version didn't fix +issues 265-277. Changed status of issues +3, 8, 9, 19, +26, 31, 61, +63, 86, 108, +112, 114, 115, +122, 127, 129, +134, 137, 142, +144, 146, 147, +159, 164, 170, +181, 199, 208, +209, 210, 211, +212, 217, 220, +222, 223, 224, +227 to "DR". Reopened issue 23. Reopened +issue 187. Changed issues 2 and +4 to NAD. Fixed a typo in issue 17. Fixed +issue 70: signature should be changed both places it +appears. Fixed issue 160: previous version didn't fix the bug in enough places.
  • R15: pre-Toronto mailing. Added issues -233-264. Some small HTML formatting +233-264. Some small HTML formatting changes so that we pass Weblint tests.
  • R14: post-Tokyo II mailing; reflects committee actions taken in -Tokyo. Added issues 228 to 232. (00-0019R1/N1242) +Tokyo. Added issues 228 to 232. (00-0019R1/N1242)
  • R13: -pre-Tokyo II updated: Added issues 212 to 227. +pre-Tokyo II updated: Added issues 212 to 227.
  • R12: -pre-Tokyo II mailing: Added issues 199 to -211. Added "and paragraph 5" to the proposed resolution -of issue 29. Add further rationale to issue -178. +pre-Tokyo II mailing: Added issues 199 to +211. Added "and paragraph 5" to the proposed resolution +of issue 29. Add further rationale to issue +178.
  • R11: post-Kona mailing: Updated to reflect LWG and full committee actions in Kona (99-0048/N1224). Note changed resolution of issues -4 and 38. Added issues 196 -to 198. Closed issues list split into "defects" and +4 and 38. Added issues 196 +to 198. Closed issues list split into "defects" and "closed" documents. Changed the proposed resolution of issue -4 to NAD, and changed the wording of proposed resolution -of issue 38. +4 to NAD, and changed the wording of proposed resolution +of issue 38.
  • R10: -pre-Kona updated. Added proposed resolutions 83, -86, 91, 92, -109. Added issues 190 to -195. (99-0033/D1209, 14 Oct 99) +pre-Kona updated. Added proposed resolutions 83, +86, 91, 92, +109. Added issues 190 to +195. (99-0033/D1209, 14 Oct 99)
  • R9: -pre-Kona mailing. Added issues 140 to -189. Issues list split into separate "active" and +pre-Kona mailing. Added issues 140 to +189. Issues list split into separate "active" and "closed" documents. (99-0030/N1206, 25 Aug 99)
  • R8: @@ -216,47 +219,47 @@ post-Dublin mailing. Updated to reflect LWG and full committee actions in Dublin. (99-0016/N1193, 21 Apr 99)
  • R7: -pre-Dublin updated: Added issues 130, 131, -132, 133, 134, -135, 136, 137, -138, 139 (31 Mar 99) +pre-Dublin updated: Added issues 130, 131, +132, 133, 134, +135, 136, 137, +138, 139 (31 Mar 99)
  • R6: -pre-Dublin mailing. Added issues 127, 128, -and 129. (99-0007/N1194, 22 Feb 99) +pre-Dublin mailing. Added issues 127, 128, +and 129. (99-0007/N1194, 22 Feb 99)
  • R5: -update issues 103, 112; added issues -114 to 126. Format revisions to prepare +update issues 103, 112; added issues +114 to 126. Format revisions to prepare for making list public. (30 Dec 98)
  • R4: -post-Santa Cruz II updated: Issues 110, -111, 112, 113 added, several +post-Santa Cruz II updated: Issues 110, +111, 112, 113 added, several issues corrected. (22 Oct 98)
  • R3: -post-Santa Cruz II: Issues 94 to 109 +post-Santa Cruz II: Issues 94 to 109 added, many issues updated to reflect LWG consensus (12 Oct 98)
  • R2: -pre-Santa Cruz II: Issues 73 to 93 added, -issue 17 updated. (29 Sep 98) +pre-Santa Cruz II: Issues 73 to 93 added, +issue 17 updated. (29 Sep 98)
  • R1: -Correction to issue 55 resolution, 60 code -format, 64 title. (17 Sep 98) +Correction to issue 55 resolution, 60 code +format, 64 title. (17 Sep 98)

Defect Reports

-

1. C library linkage editing oversight

Section: 17.4.2.2 [lib.using.linkage]  Status: TC  Submitter: Beman Dawes  Date: 16 Nov 1997

+

1. C library linkage editing oversight

Section: 17.4.2.2 [lib.using.linkage]  Status: TC  Submitter: Beman Dawes  Date: 16 Nov 1997

The change specified in the proposed resolution below did not make it into the Standard. This change was accepted in principle at the London meeting, and the exact wording below was accepted at the Morristown meeting.

Proposed resolution:

-

Change 17.4.2.2 [lib.using.linkage] paragraph 2 +

Change 17.4.2.2 [lib.using.linkage] paragraph 2 from:

@@ -274,7 +277,7 @@ from:

use extern "C++" linkage for this purpose.

-

3. Atexit registration during atexit() call is not described

Section: 18.3 [lib.support.start.term]  Status: TC  Submitter: Steve Clamage  Date: 12 Dec 1997

+

3. Atexit registration during atexit() call is not described

Section: 18.3 [lib.support.start.term]  Status: TC  Submitter: Steve Clamage  Date: 12 Dec 1997

We appear not to have covered all the possibilities of exit processing with respect to atexit registration.
@@ -393,7 +396,7 @@ committee decides.

See 99-0039/N1215, October 22, 1999, by Stephen D. Clamage for the analysis supporting to the proposed resolution.

-

5. String::compare specification questionable

Section: 21.3.6.8 [lib.string::compare]  Status: TC  Submitter: Jack Reeves  Date: 11 Dec 1997

+

5. String::compare specification questionable

Section: 21.3.6.8 [lib.string::compare]  Status: TC  Submitter: Jack Reeves  Date: 11 Dec 1997

At the very end of the basic_string class definition is the signature: int compare(size_type pos1, size_type n1, const charT* s, size_type n2 = npos) const; In the following text this is defined as: returns @@ -413,7 +416,7 @@ something like: str.compare(1, str.size()-1, s, strlen(s)-1);

pos1, size_type n1, const charT* s) const int compare(size_type pos1, size_type n1, const charT* s, size_type n2) const; each defined in terms of the corresponding constructor.

Proposed resolution:

-

Replace the compare signature in 21.3 [lib.basic.string] +

Replace the compare signature in 21.3 [lib.basic.string] (at the very end of the basic_string synopsis) which reads:

@@ -432,7 +435,7 @@ charT* s, size_type n2) const; each defined in terms of the corresponding constr size_type n2) const;

-

Replace the portion of 21.3.6.8 [lib.string::compare] +

Replace the portion of 21.3.6.8 [lib.string::compare] paragraphs 5 and 6 which read:

@@ -471,8 +474,8 @@ becomes const, matching the existing synopsis.

the Standard which must be fixed.  The same problem was also identified in issues 7 (item 5) and 87.

-

7. String clause minor problems

Section: 21 [lib.strings]  Status: TC  Submitter: Matt Austern  Date: 15 Dec 1997

-

(1) In 21.3.5.4 [lib.string::insert], the description of template +

7. String clause minor problems

Section: 21 [lib.strings]  Status: TC  Submitter: Matt Austern  Date: 15 Dec 1997

+

(1) In 21.3.5.4 [lib.string::insert], the description of template <class InputIterator> insert(iterator, InputIterator, InputIterator) makes no sense. It refers to a member function that doesn't exist. It also talks about the return value of a void @@ -493,9 +496,9 @@ possible const charT&.

charT* in the description. Second, given what it says in RETURNS, leaving out the final argument will always result in an exception getting thrown. This is paragraphs 5 and 6 of -21.3.6.8 [lib.string::compare]

+21.3.6.8 [lib.string::compare]

-

(6) In table 37, in section 21.1.1 [lib.char.traits.require], +

(6) In table 37, in section 21.1.1 [lib.char.traits.require], there's a note for X::move(s, p, n). It says "Copies correctly even where p is in [s, s+n)". This is correct as far as it goes, but it doesn't go far enough; it should also guarantee that the copy @@ -540,7 +543,7 @@ with:
     "Copies correctly even where the ranges [p, p+n) and [s, s+n) overlap."

-

8. Locale::global lacks guarantee

Section: 22.1.1.5 [lib.locale.statics]  Status: TC  Submitter: Matt Austern  Date: 24 Dec 1997

+

8. Locale::global lacks guarantee

Section: 22.1.1.5 [lib.locale.statics]  Status: TC  Submitter: Matt Austern  Date: 24 Dec 1997

It appears there's an important guarantee missing from clause 22. We're told that invoking locale::global(L) sets the C locale if L has a name. However, we're not told whether or not invoking @@ -549,7 +552,7 @@ setlocale(s) sets the global C++ locale.

The intent, I think, is that it should not, but I can't find any such words anywhere.

Proposed resolution:

-

Add a sentence at the end of 22.1.1.5 [lib.locale.statics], +

Add a sentence at the end of 22.1.1.5 [lib.locale.statics], paragraph 2: 

@@ -558,7 +561,7 @@ paragraph 2: 

-

9. Operator new(0) calls should not yield the same pointer

Section: 18.4.1 [lib.new.delete]  Status: TC  Submitter: Steve Clamage  Date: 4 Jan 1998

+

9. Operator new(0) calls should not yield the same pointer

Section: 18.4.1 [lib.new.delete]  Status: TC  Submitter: Steve Clamage  Date: 4 Jan 1998

Scott Meyers, in a comp.std.c++ posting: I just noticed that section 3.7.3.1 of CD2 seems to allow for the possibility that all calls to operator new(0) yield the same pointer, an implementation @@ -612,7 +615,7 @@ list maintainer's note: the IS is the same.]

See 99-0040/N1216, October 22, 1999, by Stephen D. Clamage for the analysis supporting to the proposed resolution.

-

11. Bitset minor problems

Section: 23.3.5 [lib.template.bitset]  Status: TC  Submitter: Matt Austern  Date: 22 Jan 1998

+

11. Bitset minor problems

Section: 23.3.5 [lib.template.bitset]  Status: TC  Submitter: Matt Austern  Date: 22 Jan 1998

(1) bitset<>::operator[] is mentioned in the class synopsis (23.3.5), but it is not documented in 23.3.5.2.

@@ -626,7 +629,7 @@ go in the Effects clause.

Proposed resolution:

ITEMS 1 AND 2:

-In the bitset synopsis (23.3.5 [lib.template.bitset]), +In the bitset synopsis (23.3.5 [lib.template.bitset]), replace the member function

    reference operator[](size_t pos);
@@ -636,7 +639,7 @@ with the two member functions
    bool operator[](size_t pos) const;
    reference operator[](size_t pos);

-Add the following text at the end of 23.3.5.2 [lib.bitset.members], +Add the following text at the end of 23.3.5.2 [lib.bitset.members], immediately after paragraph 45:

@@ -654,18 +657,18 @@ immediately after paragraph 45:

Rationale:

The LWG believes Item 3 is not a defect. "Formatted -input" implies the desired semantics. See 27.6.1.2 [lib.istream.formatted]. +input" implies the desired semantics. See 27.6.1.2 [lib.istream.formatted].

-

13. Eos refuses to die

Section: 27.6.1.2.3 [lib.istream::extractors]  Status: TC  Submitter: William M. Miller  Date: 3 Mar 1998

+

13. Eos refuses to die

Section: 27.6.1.2.3 [lib.istream::extractors]  Status: TC  Submitter: William M. Miller  Date: 3 Mar 1998

In 27.6.1.2.3, there is a reference to "eos", which is the only one in the whole draft (at least using Acrobat search), so it's undefined.

Proposed resolution:

-

In 27.6.1.2.3 [lib.istream::extractors], replace "eos" with +

In 27.6.1.2.3 [lib.istream::extractors], replace "eos" with "charT()"

-

14. Locale::combine should be const

Section: 22.1.1.3 [lib.locale.members]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

14. Locale::combine should be const

Section: 22.1.1.3 [lib.locale.members]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

locale::combine is the only member function of locale (other than constructors and destructor) that is not const. There is no reason for it not to be const, and good reasons why it should have been const. Furthermore, leaving it non-const conflicts with 22.1.1 @@ -677,31 +680,31 @@ function. As constructors are never const, there was no "const" in the interface which was transformed into member "combine". It should have been added at that time, but the omission was not noticed.

Proposed resolution:

-

In 22.1.1 [lib.locale] and also in 22.1.1.3 [lib.locale.members], add +

In 22.1.1 [lib.locale] and also in 22.1.1.3 [lib.locale.members], add "const" to the declaration of member combine: 

template <class Facet> locale combine(const locale& other) const;
-

15. Locale::name requirement inconsistent

Section: 22.1.1.3 [lib.locale.members]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

15. Locale::name requirement inconsistent

Section: 22.1.1.3 [lib.locale.members]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

locale::name() is described as returning a string that can be passed to a locale constructor, but there is no matching constructor.

Proposed resolution:

-

In 22.1.1.3 [lib.locale.members], paragraph 5, replace +

In 22.1.1.3 [lib.locale.members], paragraph 5, replace "locale(name())" with "locale(name().c_str())".

-

16. Bad ctype_byname<char> decl

Section: 22.2.1.4 [lib.locale.ctype.byname.special]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

16. Bad ctype_byname<char> decl

Section: 22.2.1.4 [lib.locale.ctype.byname.special]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

The new virtual members ctype_byname<char>::do_widen and do_narrow did not get edited in properly. Instead, the member do_widen appears four times, with wrong argument lists.

Proposed resolution:

The correct declarations for the overloaded members do_narrow and do_widen should be copied -from 22.2.1.3 [lib.facet.ctype.special].

+from 22.2.1.3 [lib.facet.ctype.special].

-

17. Bad bool parsing

Section: 22.2.2.1.2 [lib.facet.num.get.virtuals]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

17. Bad bool parsing

Section: 22.2.2.1.2 [lib.facet.num.get.virtuals]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

This section describes the process of parsing a text boolean value from the input stream. It does not say it recognizes either of the sequences "true" or "false" and returns the corresponding bool value; instead, it says it recognizes @@ -743,7 +746,7 @@ I believe the correct algorithm is "as if":

when one is a substring of the other. The proposed text below captures the logic of the code above.

Proposed resolution:

-

In 22.2.2.1.2 [lib.facet.num.get.virtuals], in the first line of paragraph 14, +

In 22.2.2.1.2 [lib.facet.num.get.virtuals], in the first line of paragraph 14, change "&&" to "&".

Then, replace paragraphs 15 and 16 as follows:

@@ -780,17 +783,17 @@ change "&&" to "&".

err==str.failbit. --end example]

-

18. Get(...bool&) omitted

Section: 22.2.2.1.1 [lib.facet.num.get.members]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

18. Get(...bool&) omitted

Section: 22.2.2.1.1 [lib.facet.num.get.members]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

In the list of num_get<> non-virtual members on page 22-23, the member that parses bool values was omitted from the list of definitions of non-virtual members, though it is listed in the class definition and the corresponding virtual is listed everywhere appropriate.

Proposed resolution:

-

Add at the beginning of 22.2.2.1.1 [lib.facet.num.get.members] +

Add at the beginning of 22.2.2.1.1 [lib.facet.num.get.members] another get member for bool&, copied from the entry in -22.2.2.1 [lib.locale.num.get].

+22.2.2.1 [lib.locale.num.get].

-

19. "Noconv" definition too vague

Section: 22.2.1.5.2 [lib.locale.codecvt.virtuals]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

19. "Noconv" definition too vague

Section: 22.2.1.5.2 [lib.locale.codecvt.virtuals]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

In the definitions of codecvt<>::do_out and do_in, they are specified to return noconv if "no conversion is @@ -800,7 +803,7 @@ normatively what is done with the buffers.

Proposed resolution:

Change the entry for noconv in the table under paragraph 4 in section -22.2.1.5.2 [lib.locale.codecvt.virtuals] to read: +22.2.1.5.2 [lib.locale.codecvt.virtuals] to read:

noconv: internT and externT are the same type, @@ -814,22 +817,22 @@ Change the entry for noconv in the table under paragraph 4 in section unchanged, and there are no changes to the values in [to, to_limit).

-

20. Thousands_sep returns wrong type

Section: 22.2.3.1.2 [lib.facet.numpunct.virtuals]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

20. Thousands_sep returns wrong type

Section: 22.2.3.1.2 [lib.facet.numpunct.virtuals]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

The synopsis for numpunct<>::do_thousands_sep, and the definition of numpunct<>::thousands_sep which calls it, specify that it returns a value of type char_type. Here it is erroneously described as returning a "string_type".

Proposed resolution:

-

In 22.2.3.1.2 [lib.facet.numpunct.virtuals], above paragraph 2, change +

In 22.2.3.1.2 [lib.facet.numpunct.virtuals], above paragraph 2, change "string_type" to "char_type".

-

21. Codecvt_byname<> instantiations

Section: 22.1.1.1.1 [lib.locale.category]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

21. Codecvt_byname<> instantiations

Section: 22.1.1.1.1 [lib.locale.category]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

In the second table in the section, captioned "Required instantiations", the instantiations for codecvt_byname<> have been omitted. These are necessary to allow users to construct a locale by name from facets.

Proposed resolution:

-

Add in 22.1.1.1.1 [lib.locale.category] to the table captioned +

Add in 22.1.1.1.1 [lib.locale.category] to the table captioned "Required instantiations", in the category "ctype" the lines

@@ -838,7 +841,7 @@ the lines

codecvt_byname<wchar_t,char,mbstate_t>
-

22. Member open vs. flags

Section: 27.8.1.7 [lib.ifstream.members]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

22. Member open vs. flags

Section: 27.8.1.7 [lib.ifstream.members]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

The description of basic_istream<>::open leaves unanswered questions about how it responds to or changes flags in the error status for the stream. A strict reading indicates that it ignores the bits and does not change them, which confuses users who do @@ -846,7 +849,7 @@ not expect eofbit and failbit to remain set after a successful open. There are t reasonable resolutions: 1) status quo 2) fail if fail(), ignore eofbit 3) clear failbit and eofbit on call to open().

Proposed resolution:

-

In 27.8.1.7 [lib.ifstream.members] paragraph 3, and in 27.8.1.10 [lib.ofstream.members] paragraph 3, under open() effects, add a footnote: +

In 27.8.1.7 [lib.ifstream.members] paragraph 3, and in 27.8.1.10 [lib.ofstream.members] paragraph 3, under open() effects, add a footnote:

@@ -864,22 +867,22 @@ one case. The resolution of this issue clarifies what the LWG believes to have been the original intent.

-

24. "do_convert" doesn't exist

Section: 22.2.1.5.2 [lib.locale.codecvt.virtuals]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

24. "do_convert" doesn't exist

Section: 22.2.1.5.2 [lib.locale.codecvt.virtuals]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

The description of codecvt<>::do_out and do_in mentions a symbol "do_convert" which is not defined in the standard. This is a leftover from an edit, and should be "do_in and do_out".

Proposed resolution:

-

In 22.2.1.5 [lib.locale.codecvt], paragraph 3, change -"do_convert" to "do_in or do_out". Also, in 22.2.1.5.2 [lib.locale.codecvt.virtuals], change "do_convert()" to "do_in +

In 22.2.1.5 [lib.locale.codecvt], paragraph 3, change +"do_convert" to "do_in or do_out". Also, in 22.2.1.5.2 [lib.locale.codecvt.virtuals], change "do_convert()" to "do_in or do_out".

-

25. String operator<< uses width() value wrong

Section: 21.3.7.9 [lib.string.io]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

25. String operator<< uses width() value wrong

Section: 21.3.7.9 [lib.string.io]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

In the description of operator<< applied to strings, the standard says that uses the smaller of os.width() and str.size(), to pad "as described in stage 3" elsewhere; but this is inconsistent, as this allows no possibility of space for padding.

Proposed resolution:

-

Change 21.3.7.9 [lib.string.io] paragraph 4 from:
+

Change 21.3.7.9 [lib.string.io] paragraph 4 from:

    "... where n is the smaller of os.width() and str.size(); ..."
@@ -889,7 +892,7 @@ to:
    "... where n is the larger of os.width() and str.size(); ..."

-

26. Bad sentry example

Section: 27.6.1.1.2 [lib.istream::sentry]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

26. Bad sentry example

Section: 27.6.1.1.2 [lib.istream::sentry]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

In paragraph 6, the code in the example: 

  template <class charT, class traits = char_traits<charT> >
@@ -913,7 +916,7 @@ particular, it fails to use traits operators, and specifies incorrect
 semantics. (E.g. it specifies skipping over the first character in the
 sequence without examining it.) 

 
Proposed resolution:

-
Remove the example above from 27.6.1.1.2  [lib.istream::sentry]
+
Remove the example above from 27.6.1.1.2  [lib.istream::sentry]
 paragraph 6.

 
Rationale:

 
The originally proposed replacement code for the example was not
@@ -923,13 +926,13 @@ code ran over one page in length and was quite complicated. The LWG
 decided that it would be counter-productive to include such a lengthy
 example, which might well still contain errors.

 

-
27. String::erase(range) yields wrong iterator
Section: 21.3.5.5  [lib.string::erase]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+
27. String::erase(range) yields wrong iterator
Section: 21.3.5.5  [lib.string::erase]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

 
The string::erase(iterator first, iterator last) is specified to return an element one
 place beyond the next element after the last one erased. E.g. for the string
 "abcde", erasing the range ['b'..'d') would yield an iterator for element 'e',
 while 'd' has not been erased. 

 
Proposed resolution:

-
In 21.3.5.5  [lib.string::erase], paragraph 10, change: 

+
In 21.3.5.5  [lib.string::erase], paragraph 10, change: 

 
 

   
Returns: an iterator which points to the element immediately following _last_ prior to
@@ -943,7 +946,7 @@ while 'd' has not been erased. 

   other elements being erased. 

 

 

-
28. Ctype<char>is ambiguous
Section: 22.2.1.3.2  [lib.facet.ctype.char.members]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+
28. Ctype<char>is ambiguous
Section: 22.2.1.3.2  [lib.facet.ctype.char.members]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

 
The description of the vector form of ctype<char>::is can be interpreted to mean
 something very different from what was intended. Paragraph 4 says 

 
@@ -955,22 +958,22 @@ something very different from what was intended. Paragraph 4 says 

 
This is intended to copy the value indexed from table()[] into the place identified in
 vec[]. 

 
Proposed resolution:

-
Change 22.2.1.3.2  [lib.facet.ctype.char.members], paragraph 4, to read 

+
Change 22.2.1.3.2  [lib.facet.ctype.char.members], paragraph 4, to read 

 
 

   
Effects: The second form, for all *p in the range [low, high), assigns into vec[p-low]
   the value table()[(unsigned char)*p]. 

 

 

-
29. Ios_base::init doesn't exist
Section: 27.3.1  [lib.narrow.stream.objects]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

-
Sections 27.3.1  [lib.narrow.stream.objects] and 27.3.2  [lib.wide.stream.objects] mention
+
29. Ios_base::init doesn't exist
Section: 27.3.1  [lib.narrow.stream.objects]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+
Sections 27.3.1  [lib.narrow.stream.objects] and 27.3.2  [lib.wide.stream.objects] mention
 a function ios_base::init, which is not defined. Probably they mean
-basic_ios<>::init, defined in 27.4.4.1  [lib.basic.ios.cons],
+basic_ios<>::init, defined in 27.4.4.1  [lib.basic.ios.cons],
 paragraph 3. 

 
Proposed resolution:

 
[R12: modified to include paragraph 5.]

 
-
In 27.3.1  [lib.narrow.stream.objects] paragraph 2 and 5, change 

+
In 27.3.1  [lib.narrow.stream.objects] paragraph 2 and 5, change 

 
 

   
ios_base::init 

@@ -982,27 +985,27 @@ paragraph 3. 

   
basic_ios<char>::init 

 

 
-
Also, make a similar change in 27.3.2  [lib.wide.stream.objects] except it
+
Also, make a similar change in 27.3.2  [lib.wide.stream.objects] except it
 should read 

 
 

   
basic_ios<wchar_t>::init 

 

 

-
30. Wrong header for LC_*
Section: 22.1.1.1.1  [lib.locale.category]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+
30. Wrong header for LC_*
Section: 22.1.1.1.1  [lib.locale.category]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

 
Paragraph 2 implies that the C macros LC_CTYPE etc. are defined in <cctype>,
 where they are in fact defined elsewhere to appear in <clocale>. 

 
Proposed resolution:

-
In 22.1.1.1.1  [lib.locale.category], paragraph 2, change
+
In 22.1.1.1.1  [lib.locale.category], paragraph 2, change
 "<cctype>" to read "<clocale>". 

 

-
31. Immutable locale values
Section: 22.1.1  [lib.locale]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+
31. Immutable locale values
Section: 22.1.1  [lib.locale]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

 
Paragraph 6, says "An instance of locale is
 immutable; once a facet reference is obtained from it,
 ...". This has caused some confusion, because locale variables
 are manifestly assignable. 

 
Proposed resolution:

-
In 22.1.1  [lib.locale] replace paragraph 6

+
In 22.1.1  [lib.locale] replace paragraph 6

 
 

   
An instance of locale is immutable; once a facet
@@ -1019,7 +1022,7 @@ are manifestly assignable. 

   long as some locale object refers to that facet.

 

 

-
32. Pbackfail description inconsistent
Section: 27.5.2.4.4  [lib.streambuf.virt.pback]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+
32. Pbackfail description inconsistent
Section: 27.5.2.4.4  [lib.streambuf.virt.pback]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

 
The description of the required state before calling virtual member
 basic_streambuf<>::pbackfail requirements is inconsistent with the conditions
 described in 27.5.2.2.4 [lib.streambuf.pub.pback] where member sputbackc calls it.
@@ -1033,7 +1036,7 @@ Specifically, the latter says it calls pbackfail if: 

 
 
It appears that the pbackfail description is wrong. 

 
Proposed resolution:

-
In 27.5.2.4.4  [lib.streambuf.virt.pback], paragraph 1, change:

+
In 27.5.2.4.4  [lib.streambuf.virt.pback], paragraph 1, change:

 
 

   
"traits::eq(*gptr(),traits::to_char_type( c))"

@@ -1049,7 +1052,7 @@ Specifically, the latter says it calls pbackfail if: 

 
Note deliberate reordering of arguments for clarity in addition to the correction of
 the argument value.

 

-
33. Codecvt<> mentions from_type
Section: 22.2.1.5.2  [lib.locale.codecvt.virtuals]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+
33. Codecvt<> mentions from_type
Section: 22.2.1.5.2  [lib.locale.codecvt.virtuals]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

 
In the table defining the results from do_out and do_in, the specification for the
 result error says 

 
@@ -1060,19 +1063,19 @@ result error says 

 
but from_type is not defined. This clearly is intended to be an externT for do_in, or
 an internT for do_out. 

 
Proposed resolution:

-
In 22.2.1.5.2  [lib.locale.codecvt.virtuals] paragraph 4, replace the definition
+
In 22.2.1.5.2  [lib.locale.codecvt.virtuals] paragraph 4, replace the definition
 in the table for the case of _error_ with 

 
 

   
encountered a character in [from,from_end) that it could not convert. 

 

 

-
34. True/falsename() not in ctype<>
Section: 22.2.2.2.2  [lib.facet.num.put.virtuals]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+
34. True/falsename() not in ctype<>
Section: 22.2.2.2.2  [lib.facet.num.put.virtuals]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

 
In paragraph 19, Effects:, members truename() and falsename are used from facet
 ctype<charT>, but it has no such members. Note that this is also a problem in
 22.2.2.1.2, addressed in (4). 

 
Proposed resolution:

-
In 22.2.2.2.2  [lib.facet.num.put.virtuals], paragraph 19, in the Effects:
+
In 22.2.2.2.2  [lib.facet.num.put.virtuals], paragraph 19, in the Effects:
 clause for member put(...., bool), replace the initialization of the
 string_type value s as follows: 

 
@@ -1081,12 +1084,12 @@ string_type value s as follows: 

 string_type s = val ? np.truename() : np.falsename();
-

35. No manipulator unitbuf in synopsis

Section: 27.4 [lib.iostreams.base]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

-

In 27.4.5.1 [lib.fmtflags.manip], we have a definition for a manipulator +

35. No manipulator unitbuf in synopsis

Section: 27.4 [lib.iostreams.base]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

In 27.4.5.1 [lib.fmtflags.manip], we have a definition for a manipulator named "unitbuf". Unlike other manipulators, it's not listed in synopsis. Similarly for "nounitbuf".

Proposed resolution:

-

Add to the synopsis for <ios> in 27.4 [lib.iostreams.base], after +

Add to the synopsis for <ios> in 27.4 [lib.iostreams.base], after the entry for "nouppercase", the prototypes:

@@ -1094,7 +1097,7 @@ the entry for "nouppercase", the prototypes:

ios_base& nounitbuf(ios_base& str);
-

36. Iword & pword storage lifetime omitted

Section: 27.4.2.5 [lib.ios.base.storage]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

36. Iword & pword storage lifetime omitted

Section: 27.4.2.5 [lib.ios.base.storage]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

In the definitions for ios_base::iword and pword, the lifetime of the storage is specified badly, so that an implementation which only keeps the last value stored appears to conform. In particular, it says:

@@ -1104,7 +1107,7 @@ member with a different index ...

This is not idle speculation; at least one implementation was done this way.

Proposed resolution:

-

Add in 27.4.2.5 [lib.ios.base.storage], in both paragraph 2 and also in +

Add in 27.4.2.5 [lib.ios.base.storage], in both paragraph 2 and also in paragraph 4, replace the sentence:

@@ -1123,7 +1126,7 @@ paragraph 4, replace the sentence:

substituting "iword" or "pword" as appropriate.

-

37. Leftover "global" reference

Section: 22.1.1 [lib.locale]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

37. Leftover "global" reference

Section: 22.1.1 [lib.locale]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

In the overview of locale semantics, paragraph 4, is the sentence

@@ -1134,14 +1137,14 @@ paragraph 4, replace the sentence:

This is not supported by the definition of use_facet<>, and represents semantics from an old draft.

Proposed resolution:

-

In 22.1.1 [lib.locale], paragraph 4, delete the parenthesized +

In 22.1.1 [lib.locale], paragraph 4, delete the parenthesized expression

(or, failing that, in the global locale)

-

38. Facet definition incomplete

Section: 22.1.2 [lib.locale.global.templates]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

38. Facet definition incomplete

Section: 22.1.2 [lib.locale.global.templates]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

It has been noticed by Esa Pulkkinen that the definition of "facet" is incomplete. In particular, a class derived from another facet, but which does not define a member id, cannot @@ -1160,7 +1163,7 @@ reads:

Requires: Facet is a facet class whose definition - contains the public static member id as defined in 22.1.1.1.2 [lib.locale.facet].

+ contains the public static member id as defined in 22.1.1.1.2 [lib.locale.facet].

[ @@ -1171,7 +1174,7 @@ contains (not inherits) the public static member ]

-

39. istreambuf_iterator<>::operator++(int) definition garbled

Section: 24.5.3.4 [lib.istreambuf.iterator::op++]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

39. istreambuf_iterator<>::operator++(int) definition garbled

Section: 24.5.3.4 [lib.istreambuf.iterator::op++]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

Following the definition of istreambuf_iterator<>::operator++(int) in paragraph 3, the standard contains three lines of garbage text left over from a previous edit.

@@ -1181,26 +1184,26 @@ sbuf_->sbumpc(); return(tmp);

Proposed resolution:

-

In 24.5.3.4 [lib.istreambuf.iterator::op++], delete the three lines of code at the +

In 24.5.3.4 [lib.istreambuf.iterator::op++], delete the three lines of code at the end of paragraph 3.

-

40. Meaningless normative paragraph in examples

Section: 22.2.8 [lib.facets.examples]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

40. Meaningless normative paragraph in examples

Section: 22.2.8 [lib.facets.examples]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

Paragraph 3 of the locale examples is a description of part of an implementation technique that has lost its referent, and doesn't mean anything.

Proposed resolution:

-

Delete 22.2.8 [lib.facets.examples] paragraph 3 which begins "This +

Delete 22.2.8 [lib.facets.examples] paragraph 3 which begins "This initialization/identification system depends...", or (at the editor's option) replace it with a place-holder to keep the paragraph numbering the same.

-

41. Ios_base needs clear(), exceptions()

Section: 27.4.2 [lib.ios.base]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

-

The description of ios_base::iword() and pword() in 27.4.2.4 [lib.ios.members.static], say that if they fail, they "set badbit, +

41. Ios_base needs clear(), exceptions()

Section: 27.4.2 [lib.ios.base]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

The description of ios_base::iword() and pword() in 27.4.2.4 [lib.ios.members.static], say that if they fail, they "set badbit, which may throw an exception". However, ios_base offers no interface to set or to test badbit; those interfaces are defined in basic_ios<>.

Proposed resolution:

-

Change the description in 27.4.2.5 [lib.ios.base.storage] in +

Change the description in 27.4.2.5 [lib.ios.base.storage] in paragraph 2, and also in paragraph 4, as follows. Replace

@@ -1220,7 +1223,7 @@ paragraph 2, and also in paragraph 4, as follows. Replace

setstate(badbit).]

-

42. String ctors specify wrong default allocator

Section: 21.3 [lib.basic.string]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

+

42. String ctors specify wrong default allocator

Section: 21.3 [lib.basic.string]  Status: TC  Submitter: Nathan Myers  Date: 6 Aug 1998

The basic_string<> copy constructor: 

basic_string(const basic_string& str, size_type pos = 0,
@@ -1236,7 +1239,7 @@ vector) do not have this form of constructor, so it is inconsistent,
 and an evident source of confusion, for basic_string<> to have
 it, so it might better be removed. 

 
Proposed resolution:

-
 In 21.3  [lib.basic.string], replace the declaration of the copy
+
 In 21.3  [lib.basic.string], replace the declaration of the copy
 constructor as follows: 

 
 

@@ -1245,7 +1248,7 @@ basic_string(const basic_string& str, size_type pos, size_type n = npos,
              const Allocator& a = Allocator());
-

In 21.3.1 [lib.string.cons], replace the copy constructor declaration +

In 21.3.1 [lib.string.cons], replace the copy constructor declaration as above. Add to paragraph 5, Effects:

@@ -1258,7 +1261,7 @@ just an unfortunate design choice.

The LWG considered two other possible resolutions:

-

A. In 21.3 [lib.basic.string], replace the declaration of the copy +

A. In 21.3 [lib.basic.string], replace the declaration of the copy constructor as follows:

@@ -1268,7 +1271,7 @@ basic_string(const basic_string& str, size_type pos, size_type n, const Allocator& a);
-

In 21.3.1 [lib.string.cons], replace the copy constructor declaration +

In 21.3.1 [lib.string.cons], replace the copy constructor declaration as above. Add to paragraph 5, Effects:

@@ -1276,7 +1279,7 @@ as above. Add to paragraph 5, Effects:

value str.get_allocator().

-

B. In 21.3 [lib.basic.string], and also in 21.3.1 [lib.string.cons], replace +

B. In 21.3 [lib.basic.string], and also in 21.3.1 [lib.string.cons], replace the declaration of the copy constructor as follows:

@@ -1293,7 +1296,7 @@ Kona: issue editing snafu fixed - the proposed resolution now correctly reflects the LWG consensus. ]

-

44. Iostreams use operator== on int_type values

Section: 27 [lib.input.output]  Status: WP  Submitter: Nathan Myers  Date: 6 Aug 1998

+

44. Iostreams use operator== on int_type values

Section: 27 [lib.input.output]  Status: WP  Submitter: Nathan Myers  Date: 6 Aug 1998

Many of the specifications for iostreams specify that character values or their int_type equivalents are compared using operators == or !=, though in other places traits::eq() or traits::eq_int_type is @@ -1559,10 +1562,10 @@ change uses of == and != to use the traits members instead.

-

46. Minor Annex D errors

Section: D.7 [depr.str.strstreams]  Status: TC  Submitter: Brendan Kehoe  Date:  1 Jun 1998

+

46. Minor Annex D errors

Section: D.7 [depr.str.strstreams]  Status: TC  Submitter: Brendan Kehoe  Date:  1 Jun 1998

See lib-6522 and edit-814.

Proposed resolution:

-

Change D.7.1 [depr.strstreambuf] (since streambuf is a typedef of +

Change D.7.1 [depr.strstreambuf] (since streambuf is a typedef of basic_streambuf<char>) from:

         virtual streambuf<char>* setbuf(char* s, streamsize n);
@@ -1571,7 +1574,7 @@ basic_streambuf<char>) from:

         virtual streambuf* setbuf(char* s, streamsize n);
-

In D.7.4 [depr.strstream] insert the semicolon now missing after +

In D.7.4 [depr.strstream] insert the semicolon now missing after int_type:

     namespace std {
@@ -1583,27 +1586,27 @@ int_type:

          typedef typename char_traits<char>::int_type int_type
          typedef typename char_traits<char>::pos_type pos_type;
-

47. Imbue() and getloc() Returns clauses swapped

Section: 27.4.2.3 [lib.ios.base.locales]  Status: TC  Submitter: Matt Austern  Date: 21 Jun 1998

+

47. Imbue() and getloc() Returns clauses swapped

Section: 27.4.2.3 [lib.ios.base.locales]  Status: TC  Submitter: Matt Austern  Date: 21 Jun 1998

Section 27.4.2.3 specifies how imbue() and getloc() work. That section has two RETURNS clauses, and they make no sense as stated. They make perfect sense, though, if you swap them. Am I correct in thinking that paragraphs 2 and 4 just got mixed up by accident?

Proposed resolution:

-

In 27.4.2.3 [lib.ios.base.locales] swap paragraphs 2 and 4.

+

In 27.4.2.3 [lib.ios.base.locales] swap paragraphs 2 and 4.

-

48. Use of non-existent exception constructor

Section: 27.4.2.1.1 [lib.ios::failure]  Status: TC  Submitter: Matt Austern  Date: 21 Jun 1998

+

48. Use of non-existent exception constructor

Section: 27.4.2.1.1 [lib.ios::failure]  Status: TC  Submitter: Matt Austern  Date: 21 Jun 1998

27.4.2.1.1, paragraph 2, says that class failure initializes the base class, exception, with exception(msg). Class exception (see 18.6.1) has no such constructor.

Proposed resolution:

-

Replace 27.4.2.1.1 [lib.ios::failure], paragraph 2, with

+

Replace 27.4.2.1.1 [lib.ios::failure], paragraph 2, with

EFFECTS: Constructs an object of class failure.

-

49. Underspecification of ios_base::sync_with_stdio

Section: 27.4.2.4 [lib.ios.members.static]  Status: WP  Submitter: Matt Austern  Date: 21 Jun 1998

+

49. Underspecification of ios_base::sync_with_stdio

Section: 27.4.2.4 [lib.ios.members.static]  Status: WP  Submitter: Matt Austern  Date: 21 Jun 1998

Two problems

(1) 27.4.2.4 doesn't say what ios_base::sync_with_stdio(f) @@ -1616,7 +1619,7 @@ synchronized with stdio. Again, of course, I can make some guesses. (And I'm unhappy about the performance implications of those guesses, but that's another matter.)

Proposed resolution:

-

Change the following sentence in 27.4.2.4 [lib.ios.members.static] +

Change the following sentence in 27.4.2.4 [lib.ios.members.static] returns clause from:

@@ -1632,7 +1635,7 @@ returns clause from:

false.

-

Add the following immediately after 27.4.2.4 [lib.ios.members.static], +

Add the following immediately after 27.4.2.4 [lib.ios.members.static], paragraph 2:

@@ -1677,7 +1680,7 @@ of "synchronization"]

text was added in the non-normative footnote to say that operations on the two streams can be mixed arbitrarily.]

-

50. Copy constructor and assignment operator of ios_base

Section: 27.4.2 [lib.ios.base]  Status: TC  Submitter: Matt Austern  Date: 21 Jun 1998

+

50. Copy constructor and assignment operator of ios_base

Section: 27.4.2 [lib.ios.base]  Status: TC  Submitter: Matt Austern  Date: 21 Jun 1998

As written, ios_base has a copy constructor and an assignment operator. (Nothing in the standard says it doesn't have one, and all classes have copy constructors and assignment operators unless you @@ -1697,13 +1700,13 @@ that intention would have required a explicit description of the semantics (e.g. what happens to the iarray and parray stuff).

Proposed resolution:

-

In 27.4.2 [lib.ios.base], class ios_base, specify the copy +

In 27.4.2 [lib.ios.base], class ios_base, specify the copy constructor and operator= members as being private.

Rationale:

The LWG believes the difficulty of specifying correct semantics outweighs any benefit of allowing ios_base objects to be copyable.

-

51. Requirement to not invalidate iterators missing

Section: 23.1 [lib.container.requirements]  Status: TC  Submitter: David Vandevoorde  Date: 23 Jun 1998

+

51. Requirement to not invalidate iterators missing

Section: 23.1 [lib.container.requirements]  Status: TC  Submitter: David Vandevoorde  Date: 23 Jun 1998

The std::sort algorithm can in general only sort a given sequence by moving around values. The list<>::sort() member on the other hand could move around values or just update internal pointers. Either @@ -1749,15 +1752,15 @@ proposed resolution below is somewhat updated from CD2-23-011, particularly the addition of the phrase "or change the values of"

-

52. Small I/O problems

Section: 27.4.3.2 [lib.fpos.operations]  Status: TC  Submitter: Matt Austern  Date: 23 Jun 1998

-

First, 27.4.4.1 [lib.basic.ios.cons], table 89. This is pretty obvious: +

52. Small I/O problems

Section: 27.4.3.2 [lib.fpos.operations]  Status: TC  Submitter: Matt Austern  Date: 23 Jun 1998

+

First, 27.4.4.1 [lib.basic.ios.cons], table 89. This is pretty obvious: it should be titled "basic_ios<>() effects", not "ios_base() effects".

-

[The second item is a duplicate; see issue 6 for +

[The second item is a duplicate; see issue 6 for resolution.]

-

Second, 27.4.3.2 [lib.fpos.operations] table 88 . There are a couple +

Second, 27.4.3.2 [lib.fpos.operations] table 88 . There are a couple different things wrong with it, some of which I've already discussed with Jerry, but the most obvious mechanical sort of error is that it uses expressions like P(i) and p(i), without ever defining what sort @@ -1772,16 +1775,16 @@ streampos arithmetic, but that it wasn't actually supposed to do anything meaningful except on platforms, like Unix, where genuine arithmetic is possible.)

Proposed resolution:

-

Change 27.4.4.1 [lib.basic.ios.cons] table 89 title from +

Change 27.4.4.1 [lib.basic.ios.cons] table 89 title from "ios_base() effects" to "basic_ios<>() effects".

-

53. Basic_ios destructor unspecified

Section: 27.4.4.1 [lib.basic.ios.cons]  Status: TC  Submitter: Matt Austern  Date: 23 Jun 1998

+

53. Basic_ios destructor unspecified

Section: 27.4.4.1 [lib.basic.ios.cons]  Status: TC  Submitter: Matt Austern  Date: 23 Jun 1998

There's nothing in 27.4.4 saying what basic_ios's destructor does. The important question is whether basic_ios::~basic_ios() destroys rdbuf().

Proposed resolution:

-

Add after 27.4.4.1 [lib.basic.ios.cons] paragraph 2:

+

Add after 27.4.4.1 [lib.basic.ios.cons] paragraph 2:

virtual ~basic_ios();

@@ -1790,25 +1793,25 @@ rdbuf().

Rationale:

The LWG reviewed the additional question of whether or not rdbuf(0) may set badbit. The answer is -clearly yes; it may be set via clear(). See 27.4.4.2 [lib.basic.ios.members], paragraph 6. This issue was reviewed at length +clearly yes; it may be set via clear(). See 27.4.4.2 [lib.basic.ios.members], paragraph 6. This issue was reviewed at length by the LWG, which removed from the original proposed resolution a footnote which incorrectly said "rdbuf(0) does not set badbit".

-

54. Basic_streambuf's destructor

Section: 27.5.2.1 [lib.streambuf.cons]  Status: TC  Submitter: Matt Austern  Date: 25 Jun 1998

+

54. Basic_streambuf's destructor

Section: 27.5.2.1 [lib.streambuf.cons]  Status: TC  Submitter: Matt Austern  Date: 25 Jun 1998

The class synopsis for basic_streambuf shows a (virtual) destructor, but the standard doesn't say what that destructor does. My assumption is that it does nothing, but the standard should say so explicitly.

Proposed resolution:

-

Add after 27.5.2.1 [lib.streambuf.cons] paragraph 2:

+

Add after 27.5.2.1 [lib.streambuf.cons] paragraph 2:

virtual  ~basic_streambuf();

Effects: None.

-

55. Invalid stream position is undefined

Section: 27 [lib.input.output]  Status: TC  Submitter: Matt Austern  Date: 26 Jun 1998

+

55. Invalid stream position is undefined

Section: 27 [lib.input.output]  Status: TC  Submitter: Matt Austern  Date: 26 Jun 1998

Several member functions in clause 27 are defined in certain circumstances to return an "invalid stream position", a term that is defined nowhere in the standard. Two places (27.5.2.4.2, @@ -1829,52 +1832,52 @@ should not be changed. Here are the three places where "invalid stream position" should not be changed:

-

27.7.1.3 [lib.stringbuf.virtuals], paragraph 14
- 27.8.1.4 [lib.filebuf.virtuals], paragraph 14
- D.7.1.3 [depr.strstreambuf.virtuals], paragraph 17 +

27.7.1.3 [lib.stringbuf.virtuals], paragraph 14
+ 27.8.1.4 [lib.filebuf.virtuals], paragraph 14
+ D.7.1.3 [depr.strstreambuf.virtuals], paragraph 17

Proposed resolution:

-

In 27.5.2.4.2 [lib.streambuf.virt.buffer], paragraph 4, change "Returns an +

In 27.5.2.4.2 [lib.streambuf.virt.buffer], paragraph 4, change "Returns an object of class pos_type that stores an invalid stream position (_lib.iostreams.definitions_)" to "Returns pos_type(off_type(-1))".

-

In 27.5.2.4.2 [lib.streambuf.virt.buffer], paragraph 6, change "Returns +

In 27.5.2.4.2 [lib.streambuf.virt.buffer], paragraph 6, change "Returns an object of class pos_type that stores an invalid stream position" to "Returns pos_type(off_type(-1))".

-

In 27.7.1.3 [lib.stringbuf.virtuals], paragraph 13, change "the object +

In 27.7.1.3 [lib.stringbuf.virtuals], paragraph 13, change "the object stores an invalid stream position" to "the return value is pos_type(off_type(-1))".

-

In 27.8.1.4 [lib.filebuf.virtuals], paragraph 13, change "returns an +

In 27.8.1.4 [lib.filebuf.virtuals], paragraph 13, change "returns an invalid stream position (27.4.3)" to "returns pos_type(off_type(-1))"

-

In 27.8.1.4 [lib.filebuf.virtuals], paragraph 15, change "Otherwise +

In 27.8.1.4 [lib.filebuf.virtuals], paragraph 15, change "Otherwise returns an invalid stream position (_lib.iostreams.definitions_)" to "Otherwise returns pos_type(off_type(-1))"

-

In D.7.1.3 [depr.strstreambuf.virtuals], paragraph 15, change "the object +

In D.7.1.3 [depr.strstreambuf.virtuals], paragraph 15, change "the object stores an invalid stream position" to "the return value is pos_type(off_type(-1))"

-

In D.7.1.3 [depr.strstreambuf.virtuals], paragraph 18, change "the object +

In D.7.1.3 [depr.strstreambuf.virtuals], paragraph 18, change "the object stores an invalid stream position" to "the return value is pos_type(off_type(-1))"

-

56. Showmanyc's return type

Section: 27.5.2 [lib.streambuf]  Status: TC  Submitter: Matt Austern  Date: 29 Jun 1998

+

56. Showmanyc's return type

Section: 27.5.2 [lib.streambuf]  Status: TC  Submitter: Matt Austern  Date: 29 Jun 1998

The class summary for basic_streambuf<>, in 27.5.2, says that showmanyc has return type int. However, 27.5.2.4.3 says that its return type is streamsize.

Proposed resolution:

Change showmanyc's return type in the -27.5.2 [lib.streambuf] class summary to streamsize.

+27.5.2 [lib.streambuf] class summary to streamsize.

-

57. Mistake in char_traits

Section: 21.1.3.2 [lib.char.traits.specializations.wchar.t]  Status: TC  Submitter: Matt Austern  Date: 1 Jul 1998

+

57. Mistake in char_traits

Section: 21.1.3.2 [lib.char.traits.specializations.wchar.t]  Status: TC  Submitter: Matt Austern  Date: 1 Jul 1998

21.1.3.2, paragraph 3, says "The types streampos and wstreampos may be different if the implementation supports no shift encoding in narrow-oriented iostreams but supports one or more shift @@ -1888,11 +1891,11 @@ to clause 21, we see in 21.1.3.1 and 21.1.3.2 that char_traits<char>::state_type and char_traits<wchar_t>::state_type must both be mbstate_t.

Proposed resolution:

-

Remove the sentence in 21.1.3.2 [lib.char.traits.specializations.wchar.t] paragraph 3 which +

Remove the sentence in 21.1.3.2 [lib.char.traits.specializations.wchar.t] paragraph 3 which begins "The types streampos and wstreampos may be different..." .

-

59. Ambiguity in specification of gbump

Section: 27.5.2.3.1 [lib.streambuf.get.area]  Status: TC  Submitter: Matt Austern  Date: 28 Jul 1998

+

59. Ambiguity in specification of gbump

Section: 27.5.2.3.1 [lib.streambuf.get.area]  Status: TC  Submitter: Matt Austern  Date: 28 Jul 1998

27.5.2.3.1 says that basic_streambuf::gbump() "Advances the next pointer for the input sequence by n."

@@ -1905,7 +1908,7 @@ pbump.

(The "classic" AT&T implementation used the former interpretation.)

Proposed resolution:

-

Change 27.5.2.3.1 [lib.streambuf.get.area] paragraph 4 gbump effects from:

+

Change 27.5.2.3.1 [lib.streambuf.get.area] paragraph 4 gbump effects from:

Effects: Advances the next pointer for the input sequence by n.

@@ -1917,10 +1920,10 @@ former interpretation.)

Effects: Adds n to the next pointer for the input sequence.

-

Make the same change to 27.5.2.3.2 [lib.streambuf.put.area] paragraph 4 pbump +

Make the same change to 27.5.2.3.2 [lib.streambuf.put.area] paragraph 4 pbump effects.

-

60. What is a formatted input function?

Section: 27.6.1.2.1 [lib.istream.formatted.reqmts]  Status: TC  Submitter: Matt Austern  Date: 3 Aug 1998

+

60. What is a formatted input function?

Section: 27.6.1.2.1 [lib.istream.formatted.reqmts]  Status: TC  Submitter: Matt Austern  Date: 3 Aug 1998

Paragraph 1 of 27.6.1.2.1 contains general requirements for all formatted input functions. Some of the functions defined in section 27.6.1.2 explicitly say that those requirements apply ("Behaves @@ -1952,16 +1955,16 @@ that the "Common requirements" listed in section 27.6.1.2.1 apply to them.

Additional comments from Dietmar Kühl: It appears to be somewhat -nonsensical to consider the functions defined in 27.6.1.2.3 [lib.istream::extractors] paragraphs 1 to 5 to be "Formatted input +nonsensical to consider the functions defined in 27.6.1.2.3 [lib.istream::extractors] paragraphs 1 to 5 to be "Formatted input function" but since these functions are defined in a section labeled "Formatted input functions" it is unclear to me whether these operators are considered formatted input functions which -have to conform to the "common requirements" from 27.6.1.2.1 [lib.istream.formatted.reqmts]: If this is the case, all manipulators, not +have to conform to the "common requirements" from 27.6.1.2.1 [lib.istream.formatted.reqmts]: If this is the case, all manipulators, not just ws, would skip whitespace unless noskipws is set (... but setting noskipws using the manipulator syntax would also skip whitespace :-)

It is not clear which functions are to be considered unformatted input functions. As written, it seems -that all functions in 27.6.1.3 [lib.istream.unformatted] are unformatted input +that all functions in 27.6.1.3 [lib.istream.unformatted] are unformatted input functions. However, it does not really make much sense to construct a sentry object for gcount(), sync(), ... Also it is unclear what happens to the gcount() if @@ -2216,7 +2219,7 @@ unformatted output function (as described in 27.6.2.6, paragraph 1)." by Judy Ward and Matt Austern. This proposed resolution is section VI of that paper.

-

61. Ambiguity in iostreams exception policy

Section: 27.6.1.3 [lib.istream.unformatted]  Status: TC  Submitter: Matt Austern  Date: 6 Aug 1998

+

61. Ambiguity in iostreams exception policy

Section: 27.6.1.3 [lib.istream.unformatted]  Status: TC  Submitter: Matt Austern  Date: 6 Aug 1998

The introduction to the section on unformatted input (27.6.1.3) says that every unformatted input function catches all exceptions that were thrown during input, sets badbit, and then conditionally rethrows @@ -2251,7 +2254,7 @@ parenthetical comment: "(Exceptions thrown from

The LWG looked to two alternative wordings, and choose the proposed resolution as better standardese.

-

62. Sync's return value

Section: 27.6.1.3 [lib.istream.unformatted]  Status: TC  Submitter: Matt Austern  Date: 6 Aug 1998

+

62. Sync's return value

Section: 27.6.1.3 [lib.istream.unformatted]  Status: TC  Submitter: Matt Austern  Date: 6 Aug 1998

The Effects clause for sync() (27.6.1.3, paragraph 36) says that it "calls rdbuf()->pubsync() and, if that function returns -1 ... returns traits::eof()."

@@ -2259,11 +2262,11 @@ resolution as better standardese.

That looks suspicious, because traits::eof() is of type traits::int_type while the return type of sync() is int.

Proposed resolution:

-

In 27.6.1.3 [lib.istream.unformatted], paragraph 36, change "returns +

In 27.6.1.3 [lib.istream.unformatted], paragraph 36, change "returns traits::eof()" to "returns -1".

-

63. Exception-handling policy for unformatted output

Section: 27.6.2.6 [lib.ostream.unformatted]  Status: TC  Submitter: Matt Austern  Date: 11 Aug 1998

+

63. Exception-handling policy for unformatted output

Section: 27.6.2.6 [lib.ostream.unformatted]  Status: TC  Submitter: Matt Austern  Date: 11 Aug 1998

Clause 27 details an exception-handling policy for formatted input, unformatted input, and formatted output. It says nothing for unformatted output (27.6.2.6). 27.6.2.6 should either include the same @@ -2293,12 +2296,12 @@ input, unformatted input, and formatted output.

64. Exception handling in basic_istream::operator>>(basic_streambuf*) -

Section: 27.6.1.2.3 [lib.istream::extractors]  Status: TC  Submitter: Matt Austern  Date: 11 Aug 1998

+

Section: 27.6.1.2.3 [lib.istream::extractors]  Status: TC  Submitter: Matt Austern  Date: 11 Aug 1998

27.6.1.2.3, paragraph 13, is ambiguous. It can be interpreted two different ways, depending on whether the second sentence is read as an elaboration of the first.

Proposed resolution:

-

Replace 27.6.1.2.3 [lib.istream::extractors], paragraph 13, which begins +

Replace 27.6.1.2.3 [lib.istream::extractors], paragraph 13, which begins "If the function inserts no characters ..." with:

@@ -2310,14 +2313,14 @@ elaboration of the first.

(27.4.4.3), then the caught exception is rethrown.

-

66. Strstreambuf::setbuf

Section: D.7.1.3 [depr.strstreambuf.virtuals]  Status: TC  Submitter: Matt Austern  Date: 18 Aug 1998

+

66. Strstreambuf::setbuf

Section: D.7.1.3 [depr.strstreambuf.virtuals]  Status: TC  Submitter: Matt Austern  Date: 18 Aug 1998

D.7.1.3, paragraph 19, says that strstreambuf::setbuf "Performs an operation that is defined separately for each class derived from strstreambuf". This is obviously an incorrect cut-and-paste from basic_streambuf. There are no classes derived from strstreambuf.

Proposed resolution:

-

D.7.1.3 [depr.strstreambuf.virtuals], paragraph 19, replace the setbuf effects +

D.7.1.3 [depr.strstreambuf.virtuals], paragraph 19, replace the setbuf effects clause which currently says "Performs an operation that is defined separately for each class derived from strstreambuf" with:

@@ -2327,7 +2330,7 @@ with:

setbuf(0,0) has no effect.

-

68. Extractors for char* should store null at end

Section: 27.6.1.2.3 [lib.istream::extractors]  Status: TC  Submitter: Angelika Langer  Date: 14 Jul 1998

+

68. Extractors for char* should store null at end

Section: 27.6.1.2.3 [lib.istream::extractors]  Status: TC  Submitter: Angelika Langer  Date: 14 Jul 1998

Extractors for char* (27.6.1.2.3) do not store a null character after the extracted character sequence whereas the unformatted functions like get() do. Why is this?

@@ -2337,7 +2340,7 @@ glitch. You'll notice that the last item of the list of what stops extraction doesn't make any sense. It was supposed to be the line that said a null is stored.

Proposed resolution:

-

27.6.1.2.3 [lib.istream::extractors], paragraph 7, change the last list +

27.6.1.2.3 [lib.istream::extractors], paragraph 7, change the last list item from:

@@ -2353,7 +2356,7 @@ item from:

extracted.
-

69. Must elements of a vector be contiguous?

Section: 23.2.4 [lib.vector]  Status: TC  Submitter: Andrew Koenig  Date: 29 Jul 1998

+

69. Must elements of a vector be contiguous?

Section: 23.2.4 [lib.vector]  Status: TC  Submitter: Andrew Koenig  Date: 29 Jul 1998

The issue is this: Must the elements of a vector be in contiguous memory?

(Please note that this is entirely separate from the question of @@ -2361,7 +2364,7 @@ whether a vector iterator is required to be a pointer; the answer to that question is clearly "no," as it would rule out debugging implementations)

Proposed resolution:

-

Add the following text to the end of 23.2.4 [lib.vector], +

Add the following text to the end of 23.2.4 [lib.vector], paragraph 1.

@@ -2378,15 +2381,15 @@ directly defined in the standard. Discussion included:

-

70. Uncaught_exception() missing throw() specification

Section: 18.6 [lib.support.exception], 18.6.4 [lib.uncaught]  Status: TC  Submitter: Steve Clamage  Date: Unknown

+

70. Uncaught_exception() missing throw() specification

Section: 18.6 [lib.support.exception], 18.6.4 [lib.uncaught]  Status: TC  Submitter: Steve Clamage  Date: Unknown

In article 3E04@pratique.fr, Valentin Bonnard writes:

uncaught_exception() doesn't have a throw specification.

@@ -2397,29 +2400,29 @@ handle exceptions thrown from uncaught_exception() ?

uncaught_exception() is called in exception handling contexts where exception safety is very important.

Proposed resolution:

-

In 15.5.3 [except.uncaught], paragraph 1, 18.6 [lib.support.exception], and 18.6.4 [lib.uncaught], add "throw()" to uncaught_exception().

+

In 15.5.3 [except.uncaught], paragraph 1, 18.6 [lib.support.exception], and 18.6.4 [lib.uncaught], add "throw()" to uncaught_exception().

-

71. Do_get_monthname synopsis missing argument

Section: 22.2.5.1 [lib.locale.time.get]  Status: TC  Submitter: Nathan Myers  Date: 13 Aug 1998

+

71. Do_get_monthname synopsis missing argument

Section: 22.2.5.1 [lib.locale.time.get]  Status: TC  Submitter: Nathan Myers  Date: 13 Aug 1998

The locale facet member time_get<>::do_get_monthname -is described in 22.2.5.1.2 [lib.locale.time.get.virtuals] with five arguments, +is described in 22.2.5.1.2 [lib.locale.time.get.virtuals] with five arguments, consistent with do_get_weekday and with its specified use by member get_monthname. However, in the synopsis, it is specified instead with four arguments. The missing argument is the "end" iterator value.

Proposed resolution:

-

In 22.2.5.1 [lib.locale.time.get], add an "end" argument to +

In 22.2.5.1 [lib.locale.time.get], add an "end" argument to the declaration of member do_monthname as follows:

  virtual iter_type do_get_monthname(iter_type s, iter_type end, ios_base&,
                                      ios_base::iostate& err, tm* t) const;

74. Garbled text for codecvt::do_max_length -

Section: 22.2.1.5.2 [lib.locale.codecvt.virtuals]  Status: TC  Submitter: Matt Austern  Date: 8 Sep 1998

+

Section: 22.2.1.5.2 [lib.locale.codecvt.virtuals]  Status: TC  Submitter: Matt Austern  Date: 8 Sep 1998

The text of codecvt::do_max_length's "Returns" clause (22.2.1.5.2, paragraph 11) is garbled. It has unbalanced parentheses and a spurious n.

Proposed resolution:

-

Replace 22.2.1.5.2 [lib.locale.codecvt.virtuals] paragraph 11 with the +

Replace 22.2.1.5.2 [lib.locale.codecvt.virtuals] paragraph 11 with the following:

@@ -2430,7 +2433,7 @@ following:

mbstate_t>::do_max_length() returns 1.
-

75. Contradiction in codecvt::length's argument types

Section: 22.2.1.5 [lib.locale.codecvt]  Status: TC  Submitter:  Matt +

75. Contradiction in codecvt::length's argument types

Section: 22.2.1.5 [lib.locale.codecvt]  Status: TC  Submitter:  Matt Austern  Date:  18 Sep 1998

The class synopses for classes codecvt<> (22.2.1.5) and codecvt_byname<> (22.2.1.6) say that the first @@ -2444,7 +2447,7 @@ synopsis or the summary must be changed.

then we must also add text saying how do_length changes its stateT argument.

Proposed resolution:

-

In 22.2.1.5 [lib.locale.codecvt], and also in 22.2.1.6 [lib.locale.codecvt.byname], +

In 22.2.1.5 [lib.locale.codecvt], and also in 22.2.1.6 [lib.locale.codecvt.byname], change the stateT argument type on both member length() and member do_length() from

@@ -2458,7 +2461,7 @@ change the stateT argument type on both member

stateT&

-

In 22.2.1.5.2 [lib.locale.codecvt.virtuals], add to the definition for member +

In 22.2.1.5.2 [lib.locale.codecvt.virtuals], add to the definition for member do_length a paragraph:

@@ -2468,7 +2471,7 @@ change the stateT argument type on both member max elements.

-

76. Can a codecvt facet always convert one internal character at a time?

Section: 22.2.1.5 [lib.locale.codecvt]  Status: WP  Submitter: Matt Austern  Date: 25 Sep 1998

+

76. Can a codecvt facet always convert one internal character at a time?

Section: 22.2.1.5 [lib.locale.codecvt]  Status: WP  Submitter: Matt Austern  Date: 25 Sep 1998

This issue concerns the requirements on classes derived from codecvt, including user-defined classes. What are the restrictions on the conversion from external characters @@ -2503,8 +2506,8 @@ sequence of M external characters that maps to a sequence of subsequence that maps to N-1 internal characters.)

Some of the wording in the standard, such as the description of -codecvt::do_max_length (22.2.1.5.2 [lib.locale.codecvt.virtuals], -paragraph 11) and basic_filebuf::underflow (27.8.1.4 [lib.filebuf.virtuals], paragraph 3) suggests that it must always be +codecvt::do_max_length (22.2.1.5.2 [lib.locale.codecvt.virtuals], +paragraph 11) and basic_filebuf::underflow (27.8.1.4 [lib.filebuf.virtuals], paragraph 3) suggests that it must always be possible to pick off internal characters one at a time from a sequence of external characters. However, this is never explicitly stated one way or the other.

@@ -2517,11 +2520,11 @@ be aware of the assumptions that the library makes. This issue affects positioning operations on basic_filebuf, unbuffered input, and several of codecvt's member functions.

Proposed resolution:

-

Add the following text as a new paragraph, following 22.2.1.5.2 [lib.locale.codecvt.virtuals] paragraph 2:

+

Add the following text as a new paragraph, following 22.2.1.5.2 [lib.locale.codecvt.virtuals] paragraph 2:

A codecvt facet that is used by basic_filebuf -(27.8 [lib.file.streams]) must have the property that if

+(27.8 [lib.file.streams]) must have the property that if

    do_out(state, from, from_end, from_next, to, to_lim, to_next)
would return ok, where from != from_end, then @@ -2576,34 +2579,34 @@ return value.]

does not expect basic_filebuf to be able to use it.

-

78. Typo: event_call_back

Section: 27.4.2 [lib.ios.base]  Status: TC  Submitter: Nico Josuttis  Date: 29 Sep 1998

+

78. Typo: event_call_back

Section: 27.4.2 [lib.ios.base]  Status: TC  Submitter: Nico Josuttis  Date: 29 Sep 1998

typo: event_call_back should be event_callback  

Proposed resolution:

-

In the 27.4.2 [lib.ios.base] synopsis change +

In the 27.4.2 [lib.ios.base] synopsis change "event_call_back" to "event_callback".

-

79. Inconsistent declaration of polar()

Section: 26.2.1 [lib.complex.synopsis], 26.2.7 [lib.complex.value.ops]  Status: TC  Submitter: Nico Josuttis  Date: 29 Sep 1998

-

In 26.2.1 [lib.complex.synopsis] polar is declared as follows:

+

79. Inconsistent declaration of polar()

Section: 26.2.1 [lib.complex.synopsis], 26.2.7 [lib.complex.value.ops]  Status: TC  Submitter: Nico Josuttis  Date: 29 Sep 1998

+

In 26.2.1 [lib.complex.synopsis] polar is declared as follows:

   template<class T> complex<T> polar(const T&, const T&);
-

In 26.2.7 [lib.complex.value.ops] it is declared as follows:

+

In 26.2.7 [lib.complex.value.ops] it is declared as follows:

   template<class T> complex<T> polar(const T& rho, const T& theta = 0);

Thus whether the second parameter is optional is not clear.

Proposed resolution:

-

In 26.2.1 [lib.complex.synopsis] change:

+

In 26.2.1 [lib.complex.synopsis] change:

   template<class T> complex<T> polar(const T&, const T&);

to:

   template<class T> complex<T> polar(const T& rho, const T& theta = 0);
-

80. Global Operators of complex declared twice

Section: 26.2.1 [lib.complex.synopsis], 26.2.2 [lib.complex]  Status: TC  Submitter: Nico Josuttis  Date: 29 Sep 1998

+

80. Global Operators of complex declared twice

Section: 26.2.1 [lib.complex.synopsis], 26.2.2 [lib.complex]  Status: TC  Submitter: Nico Josuttis  Date: 29 Sep 1998

Both 26.2.1 and 26.2.2 contain declarations of global operators for class complex. This redundancy should be removed.

Proposed resolution:

Reduce redundancy according to the general style of the standard.

-

83. String::npos vs. string::max_size()

Section: 21.3 [lib.basic.string]  Status: TC  Submitter: Nico Josuttis  Date: 29 Sep 1998

+

83. String::npos vs. string::max_size()

Section: 21.3 [lib.basic.string]  Status: TC  Submitter: Nico Josuttis  Date: 29 Sep 1998

Many string member functions throw if size is getting or exceeding npos. However, I wonder why they don't throw if size is getting or exceeding max_size() instead of npos. May be npos is known at compile @@ -2611,7 +2614,7 @@ time, while max_size() is known at runtime. However, what happens if size exceeds max_size() but not npos, then? It seems the standard lacks some clarifications here.

Proposed resolution:

-

After 21.3 [lib.basic.string] paragraph 4 ("The functions +

After 21.3 [lib.basic.string] paragraph 4 ("The functions described in this clause...") add a new paragraph:

@@ -2622,7 +2625,7 @@ described in this clause...") add a new paragraph:

Rationale:

The LWG believes length_error is the correct exception to throw.

-

86. String constructors don't describe exceptions

Section: 21.3.1 [lib.string.cons]  Status: TC  Submitter: Nico Josuttis  Date: 29 Sep 1998

+

86. String constructors don't describe exceptions

Section: 21.3.1 [lib.string.cons]  Status: TC  Submitter: Nico Josuttis  Date: 29 Sep 1998

The constructor from a range:

template<class InputIterator> 
@@ -2633,15 +2636,15 @@ described in this clause...") add a new paragraph:

 according to the other constructors if the numbers of characters in
 the range equals npos (or exceeds max_size(), see above). 

 
Proposed resolution:

-
In 21.3.1  [lib.string.cons], Strike throws paragraphs for
+
In 21.3.1  [lib.string.cons], Strike throws paragraphs for
 constructors which say "Throws: length_error if n ==
 npos."

 
Rationale:

 
Throws clauses for length_error if n == npos are no longer needed
 because they are subsumed by the general wording added by the
-resolution for issue 83.

+resolution for issue 83.

 

-
90. Incorrect description of operator >> for strings
Section: 21.3.7.9  [lib.string.io]  Status: TC  Submitter: Nico Josuttis  Date: 29 Sep 1998

+
90. Incorrect description of operator >> for strings
Section: 21.3.7.9  [lib.string.io]  Status: TC  Submitter: Nico Josuttis  Date: 29 Sep 1998

 
The effect of operator >> for strings contain the following item:

 
 
    isspace(c,getloc()) is true for the next available input
@@ -2649,7 +2652,7 @@ character c.

 
 
Here getloc() has to be replaced by is.getloc(). 

 
Proposed resolution:

-
In 21.3.7.9  [lib.string.io] paragraph 1 Effects clause replace:

+
In 21.3.7.9  [lib.string.io] paragraph 1 Effects clause replace:

 
 

   
isspace(c,getloc()) is true for the next available input character c.

@@ -2661,13 +2664,13 @@ character c.

   
isspace(c,is.getloc()) is true for the next available input character c.

 

 

-
91. Description of operator>> and getline() for string<> might cause endless loop
Section: 21.3.7.9  [lib.string.io]  Status: WP  Submitter: Nico Josuttis  Date: 29 Sep 1998

+
91. Description of operator>> and getline() for string<> might cause endless loop
Section: 21.3.7.9  [lib.string.io]  Status: WP  Submitter: Nico Josuttis  Date: 29 Sep 1998

 
Operator >> and getline() for strings read until eof()
 in the input stream is true. However, this might never happen, if the
 stream can't read anymore without reaching EOF. So shouldn't it be
 changed into that it reads until !good() ? 

 
Proposed resolution:

-
In 21.3.7.9  [lib.string.io], paragraph 1, replace:

+
In 21.3.7.9  [lib.string.io], paragraph 1, replace:

 

 Effects: Begins by constructing a sentry object k as if k were
 constructed by typename basic_istream<charT,traits>::sentry k( is). If
@@ -2679,7 +2682,7 @@ extracted and appended until any of the following occurs:
 

 
with:

 

-Effects: Behaves as a formatted input function (27.6.1.2.1  [lib.istream.formatted.reqmts]).  After constructing a sentry object, if the
+Effects: Behaves as a formatted input function (27.6.1.2.1  [lib.istream.formatted.reqmts]).  After constructing a sentry object, if the
 sentry converts to true, calls str.erase() and then extracts
 characters from is and appends them to str as if by calling
 str.append(1,c). If is.width() is greater than zero, the maximum
@@ -2688,7 +2691,7 @@ str.max_size(). Characters are extracted and appended until any of the
 following occurs:
 

 
-
In 21.3.7.9  [lib.string.io], paragraph 6, replace

+
In 21.3.7.9  [lib.string.io], paragraph 6, replace

 

 Effects: Begins by constructing a sentry object k as if by typename
 basic_istream<charT,traits>::sentry k( is, true). If bool( k) is true,
@@ -2698,7 +2701,7 @@ following occurs:
 

 
with:

 

-Effects: Behaves as an unformatted input function (27.6.1.3  [lib.istream.unformatted]), except that it does not affect the value returned
+Effects: Behaves as an unformatted input function (27.6.1.3  [lib.istream.unformatted]), except that it does not affect the value returned
 by subsequent calls to basic_istream<>::gcount().  After
 constructing a sentry object, if the sentry converts to true, calls
 str.erase() and then extracts characters from is and appends them to
@@ -2722,7 +2725,7 @@ returning eof or by throwing an exception; there are no other
 possibilities.  The proposed resolution makes it clear that these two
 functions do get characters from a streambuf.

 

-
92. Incomplete Algorithm Requirements
Section: 25  [lib.algorithms]  Status: WP  Submitter: Nico Josuttis  Date: 29 Sep 1998

+
92. Incomplete Algorithm Requirements
Section: 25  [lib.algorithms]  Status: WP  Submitter: Nico Josuttis  Date: 29 Sep 1998

 
The standard does not state, how often a function object is copied,
 called, or the order of calls inside an algorithm. This may lead to
 surprising/buggy behavior. Consider the following example: 

@@ -2771,7 +2774,7 @@ cost it could be avoided (just implement it directly instead of
 calling find_if()). 

 
Proposed resolution:

 
-
Add a new paragraph following 25  [lib.algorithms] paragraph 8:

+
Add a new paragraph following 25  [lib.algorithms] paragraph 8:

 

 [Note: Unless otherwise specified, algorithms that take function
 objects as arguments are permitted to copy those function objects
@@ -2799,7 +2802,7 @@ library book for a detailed discussion.]

 
[Kona: Nico will provide wording to the effect that "unless
 otherwise specified, the number of copies of and calls to function
 objects by algorithms is unspecified".  Consider placing in
-25  [lib.algorithms] after paragraph 9.]

+25  [lib.algorithms] after paragraph 9.]

 
 
[Santa Cruz: The standard doesn't currently guarantee that
   functions object won't be copied, and what isn't forbidden is
@@ -2814,8 +2817,8 @@ objects by algorithms is unspecified".  Consider placing in
 
 
 

-
98. Input iterator requirements are badly written
Section: 24.1.1  [lib.input.iterators]  Status: WP  Submitter: AFNOR  Date: 7 Oct 1998

-
Table 72 in 24.1.1  [lib.input.iterators] specifies semantics for
+
98. Input iterator requirements are badly written
Section: 24.1.1  [lib.input.iterators]  Status: WP  Submitter: AFNOR  Date: 7 Oct 1998

+
Table 72 in 24.1.1  [lib.input.iterators] specifies semantics for
 *r++ of:

 
 
   { T tmp = *r; ++r; return tmp; }

@@ -2828,11 +2831,11 @@ This is too specific: we want to allow *r++ to return an lvalue.

 suggests that the effects *r++ should precisely replicate the behavior
 of this code, including side effects.  (Does this mean that *r++
 should invoke the copy constructor exactly as many times as the sample
-code above would?) See issue 334 for a similar
+code above would?) See issue 334 for a similar
 problem.

 
 
Proposed resolution:

-In Table 72 in 24.1.1  [lib.input.iterators], change the return type
+In Table 72 in 24.1.1  [lib.input.iterators], change the return type
 for *r++ from T to "convertible to T".
 
Rationale:

 
This issue has two parts: the return type, and the number of times
@@ -2854,7 +2857,7 @@ for *r++ from T to "convertible to T".
    of input iterators, we can't impose any requirements in the Input
    Iterator requirements table that forward iterators don't satisfy.

 

-
103. set::iterator is required to be modifiable, but this allows modification of keys
Section: 23.1.2  [lib.associative.reqmts]  Status: WP  Submitter: AFNOR  Date: 7 Oct 1998

+
103. set::iterator is required to be modifiable, but this allows modification of keys
Section: 23.1.2  [lib.associative.reqmts]  Status: WP  Submitter: AFNOR  Date: 7 Oct 1998

 
Set::iterator is described as implementation-defined with a
 reference to the container requirement; the container requirement says
 that const_iterator is an iterator pointing to const T and iterator an
@@ -2869,7 +2872,7 @@ const_iterator. Set, for example, has the following: 

 
typedef implementation defined iterator;

        // See _lib.container.requirements_

 
-
23.1  [lib.container.requirements] actually requires that iterator type pointing
+
23.1  [lib.container.requirements] actually requires that iterator type pointing
 to T (table 65). Disallowing user modification of keys by changing the
 standard to require an iterator for associative container to be the
 same as const_iterator would be overkill since that will unnecessarily
@@ -2882,7 +2885,7 @@ goes in line with trusting user knows what he is doing. 

 
 
Other Options Evaluated: 

 
-
Option A.   In 23.1.2  [lib.associative.reqmts], paragraph 2, after
+
Option A.   In 23.1.2  [lib.associative.reqmts], paragraph 2, after
 first sentence, and before "In addition,...", add one line:
 

 
@@ -2890,7 +2893,7 @@ first sentence, and before "In addition,...", add one line:
   
Modification of keys shall not change their strict weak ordering. 

 

 
-
Option B. Add three new sentences to 23.1.2  [lib.associative.reqmts]:

+
Option B. Add three new sentences to 23.1.2  [lib.associative.reqmts]:

 
 

   
At the end of paragraph 5: "Keys in an associative container
@@ -2902,7 +2905,7 @@ first sentence, and before "In addition,...", add one line:
   type."

 

 
-
Option C. To 23.1.2  [lib.associative.reqmts], paragraph 3, which
+
Option C. To 23.1.2  [lib.associative.reqmts], paragraph 3, which
 currently reads:

 
 

@@ -2925,7 +2928,7 @@ currently reads:

   different than it was the previous time k2 was in the container.]

 

 
Proposed resolution:

-
Add the following to 23.1.2  [lib.associative.reqmts] at
+
Add the following to 23.1.2  [lib.associative.reqmts] at
 the indicated location:

 
 

@@ -2963,7 +2966,7 @@ conversion from iterator to const_iterator.
 
 
[Tokyo: The LWG crafted the proposed resolution and rationale.]

 

-
106. Numeric library private members are implementation defined
Section: 26.3.5  [lib.template.slice.array]  Status: TC  Submitter: AFNOR  Date: 7 Oct 1998

+
106. Numeric library private members are implementation defined
Section: 26.3.5  [lib.template.slice.array]  Status: TC  Submitter: AFNOR  Date: 7 Oct 1998

 
This is the only place in the whole standard where the implementation has to document
 something private.

 
Proposed resolution:

@@ -2972,23 +2975,23 @@ Remove the comment which says "// remainder implementation defined" from:
 

 
 
 

-
108. Lifetime of exception::what() return unspecified
Section: 18.6.1  [lib.exception]  Status: TC  Submitter: AFNOR  Date: 7 Oct 1998

+
108. Lifetime of exception::what() return unspecified
Section: 18.6.1  [lib.exception]  Status: TC  Submitter: AFNOR  Date: 7 Oct 1998

 
In 18.6.1, paragraphs 8-9, the lifetime of the return value of
 exception::what() is left unspecified. This issue has implications
 with exception safety of exception handling: some exceptions should
 not throw bad_alloc.

 
Proposed resolution:

-
Add to 18.6.1  [lib.exception] paragraph 9 (exception::what notes
+
Add to 18.6.1  [lib.exception] paragraph 9 (exception::what notes
 clause) the sentence:

 
 

@@ -3001,7 +3004,7 @@ to set internal state that should affect the contents of the string
 returned by what().
 

 

-
109. Missing binders for non-const sequence elements
Section: 20.3.6  [lib.binders]  Status: WP  Submitter: Bjarne Stroustrup  Date: 7 Oct 1998

+
109. Missing binders for non-const sequence elements
Section: 20.3.6  [lib.binders]  Status: WP  Submitter: Bjarne Stroustrup  Date: 7 Oct 1998

 
 
There are no versions of binders that apply to non-const elements
 of a sequence. This makes examples like for_each() using bind2nd() on
@@ -3076,7 +3079,7 @@ public:
 
Howard believes there is a flaw in this resolution.
 See c++std-lib-9127.  We may need to reopen this issue.

 
-
In 20.3.6.1  [lib.binder.1st] in the declaration of binder1st after:

+
In 20.3.6.1  [lib.binder.1st] in the declaration of binder1st after:

 

   
typename Operation::result_type

    operator()(const typename Operation::second_argument_type& x) const;

@@ -3086,7 +3089,7 @@ See c++std-lib-9127.  We may need to reopen this issue.

   
typename Operation::result_type

    operator()(typename Operation::second_argument_type& x) const;

 

-
In 20.3.6.3  [lib.binder.2nd] in the declaration of binder2nd after:

+
In 20.3.6.3  [lib.binder.2nd] in the declaration of binder2nd after:

 

   
typename Operation::result_type

    operator()(const typename Operation::first_argument_type& x) const;

@@ -3107,12 +3110,12 @@ Strap poll: NAD - 0.  Accept proposed resolution - 10.
 Leave open - 1.]

 
 

-
110. istreambuf_iterator::equal not const
Section: 24.5.3  [lib.istreambuf.iterator], 24.5.3.5  [lib.istreambuf.iterator::equal]  Status: TC  Submitter: Nathan Myers  Date: 15 Oct 1998

+
110. istreambuf_iterator::equal not const
Section: 24.5.3  [lib.istreambuf.iterator], 24.5.3.5  [lib.istreambuf.iterator::equal]  Status: TC  Submitter: Nathan Myers  Date: 15 Oct 1998

 
Member istreambuf_iterator<>::equal is not declared
-"const", yet 24.5.3.6  [lib.istreambuf.iterator::op==] says that operator==,
+"const", yet 24.5.3.6  [lib.istreambuf.iterator::op==] says that operator==,
 which is const, calls it. This is contradictory. 

 
Proposed resolution:

-
In 24.5.3  [lib.istreambuf.iterator] and also in 24.5.3.5  [lib.istreambuf.iterator::equal],
+
In 24.5.3  [lib.istreambuf.iterator] and also in 24.5.3.5  [lib.istreambuf.iterator::equal],
 replace:

 
 

@@ -3125,13 +3128,13 @@ replace:

   
bool equal(const istreambuf_iterator& b) const;

 

 

-
112. Minor typo in ostreambuf_iterator constructor
Section: 24.5.4.1  [lib.ostreambuf.iter.cons]  Status: TC  Submitter: Matt Austern  Date: 20 Oct 1998

+
112. Minor typo in ostreambuf_iterator constructor
Section: 24.5.4.1  [lib.ostreambuf.iter.cons]  Status: TC  Submitter: Matt Austern  Date: 20 Oct 1998

 
The requires clause for ostreambuf_iterator's
 constructor from an ostream_type (24.5.4.1, paragraph 1)
 reads "s is not null". However, s is a
 reference, and references can't be null. 

 
Proposed resolution:

-
In 24.5.4.1  [lib.ostreambuf.iter.cons]:

+
In 24.5.4.1  [lib.ostreambuf.iter.cons]:

 
 
Move the current paragraph 1, which reads "Requires: s is not
 null.", from the first constructor to the second constructor.

@@ -3143,7 +3146,7 @@ reading:

   
Requires: s.rdbuf() is not null.

 

 

-
114. Placement forms example in error twice
Section: 18.4.1.3  [lib.new.delete.placement]  Status: TC  Submitter: Steve Clamage  Date: 28 Oct 1998

+
114. Placement forms example in error twice
Section: 18.4.1.3  [lib.new.delete.placement]  Status: TC  Submitter: Steve Clamage  Date: 28 Oct 1998

 
Section 18.4.1.3 contains the following example: 

 
 
[Example: This can be useful for constructing an object at a known address:
@@ -3161,14 +3164,14 @@ believes the () are correct.]

 likely to fail.

 
Proposed resolution:

 
Replace the  first line of code in the example in 
-18.4.1.3  [lib.new.delete.placement] with:
+18.4.1.3  [lib.new.delete.placement] with:
 

 
 

   
void* place = operator new(sizeof(Something));

 

 

-
115. Typo in strstream constructors
Section: D.7.4.1  [depr.strstream.cons]  Status: TC  Submitter: Steve Clamage  Date: 2 Nov 1998

+
115. Typo in strstream constructors
Section: D.7.4.1  [depr.strstream.cons]  Status: TC  Submitter: Steve Clamage  Date: 2 Nov 1998

 
D.7.4.1 strstream constructors paragraph 2 says: 

 
 

@@ -3185,11 +3188,11 @@ likely to fail.

 should be "If mode&app==app", or "mode&app!=0", meaning that
 the append bit is set.

 
Proposed resolution:

-
In D.7.3.1  [depr.ostrstream.cons] paragraph 2 and D.7.4.1  [depr.strstream.cons]
+
In D.7.3.1  [depr.ostrstream.cons] paragraph 2 and D.7.4.1  [depr.strstream.cons]
 paragraph 2, change the first condition to (mode&app)==0
 and the second condition to (mode&app)!=0.

 

-
117. basic_ostream uses nonexistent num_put member functions
Section: 27.6.2.5.2  [lib.ostream.inserters.arithmetic]  Status: WP  Submitter: Matt Austern  Date: 20 Nov 1998

+
117. basic_ostream uses nonexistent num_put member functions
Section: 27.6.2.5.2  [lib.ostream.inserters.arithmetic]  Status: WP  Submitter: Matt Austern  Date: 20 Nov 1998

 
The effects clause for numeric inserters says that
 insertion of a value x, whose type is either bool,
 short, unsigned short, int, unsigned
@@ -3295,7 +3298,7 @@ complicated, but gives more expected results for hex and octal output
 of signed short and signed int.  (On a system with 16-bit short, for
 example, printing short(-1) in hex format should yield 0xffff.)

 

-
118. basic_istream uses nonexistent num_get member functions
Section: 27.6.1.2.2  [lib.istream.formatted.arithmetic]  Status: WP  Submitter: Matt Austern  Date: 20 Nov 1998

+
118. basic_istream uses nonexistent num_get member functions
Section: 27.6.1.2.2  [lib.istream.formatted.arithmetic]  Status: WP  Submitter: Matt Austern  Date: 20 Nov 1998

 
Formatted input is defined for the types short, unsigned short, int,
 unsigned int, long, unsigned long, float, double,
 long double, bool, and void*. According to section 27.6.1.2.2,
@@ -3306,7 +3309,7 @@ iostate err = 0;
 use_facet< numget >(loc).get(*this, 0, *this, err, val); 
 setstate(err);

 
-
According to section 22.2.2.1.1  [lib.facet.num.get.members], however,
+
According to section 22.2.2.1.1  [lib.facet.num.get.members], however,
 num_get<>::get() is only overloaded for the types
 bool, long, unsigned short, unsigned
 int, unsigned long, unsigned long,
@@ -3315,7 +3318,7 @@ int, unsigned long, unsigned long,
 that 27.6.1.2.2 is using a nonexistent function for types
 short and int. 

 
Proposed resolution:

-
In 27.6.1.2.2  [lib.istream.formatted.arithmetic] Arithmetic Extractors, remove the
+
In 27.6.1.2.2  [lib.istream.formatted.arithmetic] Arithmetic Extractors, remove the
 two lines (1st and 3rd) which read:

 

   
operator>>(short& val);
@@ -3352,8 +3355,8 @@ operator>>(int& val);

 
 
[Post-Tokyo: PJP provided the above wording.]

 

-
119. Should virtual functions be allowed to strengthen the exception specification?
Section: 17.4.4.8  [lib.res.on.exception.handling]  Status: TC  Submitter: Judy Ward  Date: 15 Dec 1998

-
Section 17.4.4.8  [lib.res.on.exception.handling] states: 

+
119. Should virtual functions be allowed to strengthen the exception specification?
Section: 17.4.4.8  [lib.res.on.exception.handling]  Status: TC  Submitter: Judy Ward  Date: 15 Dec 1998

+
Section 17.4.4.8  [lib.res.on.exception.handling] states: 

 
 
"An implementation may strengthen the exception-specification
 for a function by removing listed exceptions." 

@@ -3375,7 +3378,7 @@ public:
               // overridden virtual function ios_base::failure::~failure()
 };

Proposed resolution:

-

Change Section 17.4.4.8 [lib.res.on.exception.handling] from:

+

Change Section 17.4.4.8 [lib.res.on.exception.handling] from:

     "may strengthen the exception-specification for a function"

@@ -3385,7 +3388,7 @@ exception-specification for a function"

     "may strengthen the exception-specification for a non-virtual function".

-

120. Can an implementor add specializations?

Section: 17.4.3.1 [lib.reserved.names]  Status: WP  Submitter: Judy Ward  Date: 15 Dec 1998

+

120. Can an implementor add specializations?

Section: 17.4.3.1 [lib.reserved.names]  Status: WP  Submitter: Judy Ward  Date: 15 Dec 1998

The original issue asked whether a library implementor could specialize standard library templates for built-in types. (This was @@ -3430,7 +3433,7 @@ special: the "undefined behavior" that results from having two different explicit instantiations might be harmless.

Proposed resolution:

-

Append to 17.4.3.1 [lib.reserved.names] paragraph 1:

+

Append to 17.4.3.1 [lib.reserved.names] paragraph 1:

A program may explicitly instantiate any templates in the standard library only if the declaration depends on the name of a user-defined @@ -3446,7 +3449,7 @@ different explicit instantiations might be harmless.

In light of the resolution to core issue 259, no normative changes in the library clauses are necessary. Add the following non-normative - note to the end of 17.4.3.1 [lib.reserved.names] paragraph 1:

+ note to the end of 17.4.3.1 [lib.reserved.names] paragraph 1:

[Note: A program may explicitly instantiate standard library templates, even when an explicit instantiation does not depend on @@ -3485,7 +3488,7 @@ different explicit instantiations might be harmless.

linking. If there are such changes in the future, it may be appropriate to revisit this issue later.

-

122. streambuf/wstreambuf description should not say they are specializations

Section: 27.5.2 [lib.streambuf]  Status: TC  Submitter: Judy Ward  Date: 15 Dec 1998

+

122. streambuf/wstreambuf description should not say they are specializations

Section: 27.5.2 [lib.streambuf]  Status: TC  Submitter: Judy Ward  Date: 15 Dec 1998

Section 27.5.2 describes the streambuf classes this way:

@@ -3502,27 +3505,27 @@ specialized for the type wchar_t.

It doesn't seem this was intended, since Section 27.5 has them declared as typedefs.

Proposed resolution:

-

Remove 27.5.2 [lib.streambuf] paragraphs 2 and 3 (the above two +

Remove 27.5.2 [lib.streambuf] paragraphs 2 and 3 (the above two sentences).

Rationale:

The streambuf synopsis already has a declaration for the typedefs and that is sufficient.

-

123. Should valarray helper arrays fill functions be const?

Section: 26.3.5.4 [lib.slice.arr.fill], 26.3.7.4 [lib.gslice.array.fill], 26.3.8.4 [lib.mask.array.fill], 26.3.9.4 [lib.indirect.array.fill]  Status: WP  Submitter: Judy Ward  Date: 15 Dec 1998

+

123. Should valarray helper arrays fill functions be const?

Section: 26.3.5.4 [lib.slice.arr.fill], 26.3.7.4 [lib.gslice.array.fill], 26.3.8.4 [lib.mask.array.fill], 26.3.9.4 [lib.indirect.array.fill]  Status: WP  Submitter: Judy Ward  Date: 15 Dec 1998

One of the operator= in the valarray helper arrays is const and one is not. For example, look at slice_array. This operator= in Section -26.3.5.2 [lib.slice.arr.assign] is const:

+26.3.5.2 [lib.slice.arr.assign] is const:

    void operator=(const valarray<T>&) const;

-

but this one in Section 26.3.5.4 [lib.slice.arr.fill] is not:

+

but this one in Section 26.3.5.4 [lib.slice.arr.fill] is not:

    void operator=(const T&);

The description of the semantics for these two functions is similar.

Proposed resolution:

-

26.3.5 [lib.template.slice.array] Template class slice_array

+

26.3.5 [lib.template.slice.array] Template class slice_array

In the class template definition for slice_array, replace the member @@ -3534,7 +3537,7 @@ is not. For example, look at slice_array. This operator= in Section

-

26.3.5.4 [lib.slice.arr.fill] slice_array fill function

+

26.3.5.4 [lib.slice.arr.fill] slice_array fill function

Change the function declaration

@@ -3545,7 +3548,7 @@ is not. For example, look at slice_array. This operator= in Section
-

26.3.7 [lib.template.gslice.array] Template class gslice_array

+

26.3.7 [lib.template.gslice.array] Template class gslice_array

In the class template definition for gslice_array, replace the member @@ -3557,7 +3560,7 @@ is not. For example, look at slice_array. This operator= in Section

-

26.3.7.4 [lib.gslice.array.fill] gslice_array fill function

+

26.3.7.4 [lib.gslice.array.fill] gslice_array fill function

Change the function declaration

@@ -3568,7 +3571,7 @@ is not. For example, look at slice_array. This operator= in Section
-

26.3.8 [lib.template.mask.array] Template class mask_array

+

26.3.8 [lib.template.mask.array] Template class mask_array

In the class template definition for mask_array, replace the member @@ -3580,19 +3583,18 @@ is not. For example, look at slice_array. This operator= in Section

-

26.3.8.4 [lib.mask.array.fill] mask_array fill function

+

26.3.8.4 [lib.mask.array.fill] mask_array fill function

Change the function declaration

- 
-      void operator=(const T&);
+    
      void operator=(const T&);
     

    
to

     
      void operator=(const T&) const;
-

26.3.9 [lib.template.indirect.array] Template class indirect_array

+

26.3.9 [lib.template.indirect.array] Template class indirect_array

In the class template definition for indirect_array, replace the member @@ -3604,7 +3606,7 @@ is not. For example, look at slice_array. This operator= in Section

-

26.3.9.4 [lib.indirect.array.fill] indirect_array fill function

+

26.3.9.4 [lib.indirect.array.fill] indirect_array fill function

Change the function declaration

@@ -3620,32 +3622,32 @@ is not. For example, look at slice_array. This operator= in Section

Rationale:

There's no good reason for one version of operator= being const and -another one not. Because of issue 253, this now +another one not. Because of issue 253, this now matters: these functions are now callable in more circumstances. In many existing implementations, both versions are already const.

-

124. ctype_byname<charT>::do_scan_is & do_scan_not return type should be const charT*

Section: 22.2.1.2 [lib.locale.ctype.byname]  Status: TC  Submitter: Judy Ward  Date: 15 Dec 1998

-

In Section 22.2.1.2 [lib.locale.ctype.byname] +

124. ctype_byname<charT>::do_scan_is & do_scan_not return type should be const charT*

Section: 22.2.1.2 [lib.locale.ctype.byname]  Status: TC  Submitter: Judy Ward  Date: 15 Dec 1998

+

In Section 22.2.1.2 [lib.locale.ctype.byname] ctype_byname<charT>::do_scan_is() and do_scan_not() are declared to return a const char* not a const charT*.

Proposed resolution:

-

Change Section 22.2.1.2 [lib.locale.ctype.byname] do_scan_is() and +

Change Section 22.2.1.2 [lib.locale.ctype.byname] do_scan_is() and do_scan_not() to return a const charT*.

-

125. valarray<T>::operator!() return type is inconsistent

Section: 26.3.2 [lib.template.valarray]  Status: TC  Submitter: Judy Ward  Date: 15 Dec 1998

-

In Section 26.3.2 [lib.template.valarray] valarray<T>::operator!() is -declared to return a valarray<T>, but in Section 26.3.2.5 [lib.valarray.unary] it is declared to return a valarray<bool>. The +

125. valarray<T>::operator!() return type is inconsistent

Section: 26.3.2 [lib.template.valarray]  Status: TC  Submitter: Judy Ward  Date: 15 Dec 1998

+

In Section 26.3.2 [lib.template.valarray] valarray<T>::operator!() is +declared to return a valarray<T>, but in Section 26.3.2.5 [lib.valarray.unary] it is declared to return a valarray<bool>. The latter appears to be correct.

Proposed resolution:

-

Change in Section 26.3.2 [lib.template.valarray] the declaration of +

Change in Section 26.3.2 [lib.template.valarray] the declaration of operator!() so that the return type is valarray<bool>.

-

126. typos in Effects clause of ctype::do_narrow()

Section: 22.2.1.1.2 [lib.locale.ctype.virtuals]  Status: TC  Submitter: Judy Ward  Date: 15 Dec 1998

+

126. typos in Effects clause of ctype::do_narrow()

Section: 22.2.1.1.2 [lib.locale.ctype.virtuals]  Status: TC  Submitter: Judy Ward  Date: 15 Dec 1998

Typos in 22.2.1.1.2 need to be fixed.

Proposed resolution:

-

In Section 22.2.1.1.2 [lib.locale.ctype.virtuals] change:

+

In Section 22.2.1.1.2 [lib.locale.ctype.virtuals] change: 

   do_widen(do_narrow(c),0) == c
@@ -3661,7 +3663,7 @@ latter appears to be correct. 

   (is(M,c) || !ctc.is(M, do_narrow(c,dfault)) )
-

127. auto_ptr<> conversion issues

Section: 20.4.5 [lib.auto.ptr]  Status: TC  Submitter: Greg Colvin  Date: 17 Feb 1999

+

127. auto_ptr<> conversion issues

Section: 20.4.5 [lib.auto.ptr]  Status: TC  Submitter: Greg Colvin  Date: 17 Feb 1999

There are two problems with the current auto_ptr wording in the standard:

@@ -3698,23 +3700,23 @@ object parameter may be bound to an rvalue [13.3.3.1.4/3]

Tokyo: The LWG removed the following from the proposed resolution:

-

In 20.4.5 [lib.auto.ptr], paragraph 2, and 20.4.5.3 [lib.auto.ptr.conv], +

In 20.4.5 [lib.auto.ptr], paragraph 2, and 20.4.5.3 [lib.auto.ptr.conv], paragraph 2, make the conversion to auto_ptr_ref const:

template<class Y> operator auto_ptr_ref<Y>() const throw();

Proposed resolution:

-

In 20.4.5 [lib.auto.ptr], paragraph 2, move +

In 20.4.5 [lib.auto.ptr], paragraph 2, move the auto_ptr_ref definition to namespace scope.

-

In 20.4.5 [lib.auto.ptr], paragraph 2, add +

In 20.4.5 [lib.auto.ptr], paragraph 2, add a public assignment operator to the auto_ptr definition: 

auto_ptr& operator=(auto_ptr_ref<X> r) throw();
-

Also add the assignment operator to 20.4.5.3 [lib.auto.ptr.conv]:

+

Also add the assignment operator to 20.4.5.3 [lib.auto.ptr.conv]: 

auto_ptr& operator=(auto_ptr_ref<X> r) throw()
@@ -3725,7 +3727,7 @@ a public assignment operator to the auto_ptr definition:

-

129. Need error indication from seekp() and seekg()

Section: 27.6.1.3 [lib.istream.unformatted], 27.6.2.4 [lib.ostream.seeks]  Status: TC  Submitter: Angelika Langer  Date: 22 Feb 1999

+

129. Need error indication from seekp() and seekg()

Section: 27.6.1.3 [lib.istream.unformatted], 27.6.2.4 [lib.ostream.seeks]  Status: TC  Submitter: Angelika Langer  Date: 22 Feb 1999

Currently, the standard does not specify how seekg() and seekp() indicate failure. They are not required to set failbit, and they can't return an error indication because they must return *this, i.e. the @@ -3738,8 +3740,8 @@ stream must perform a state-dependent code conversion, etc.

stream state in case of failure.

Proposed resolution:

Add to the Effects: clause of  seekg() in -27.6.1.3 [lib.istream.unformatted] and to the Effects: clause of seekp() in -27.6.2.4 [lib.ostream.seeks]:

+27.6.1.3 [lib.istream.unformatted] and to the Effects: clause of seekp() in +27.6.2.4 [lib.ostream.seeks]:

In case of failure, the function calls setstate(failbit) (which may throw ios_base::failure). @@ -3748,7 +3750,7 @@ stream state in case of failure.

Rationale:

Setting failbit is the usual error reporting mechanism for streams

-

132. list::resize description uses random access iterators

Section: 23.2.2.2 [lib.list.capacity]  Status: TC  Submitter: Howard Hinnant  Date: 6 Mar 1999

+

132. list::resize description uses random access iterators

Section: 23.2.2.2 [lib.list.capacity]  Status: TC  Submitter: Howard Hinnant  Date: 6 Mar 1999

The description reads:

-1- Effects:

@@ -3779,22 +3781,22 @@ stream state in case of failure.

with David Abrahams. They had a discussion and believe there is no issue of exception safety with the proposed resolution.]

-

133. map missing get_allocator()

Section: 23.3.1 [lib.map]  Status: TC  Submitter: Howard Hinnant  Date: 6 Mar 1999

+

133. map missing get_allocator()

Section: 23.3.1 [lib.map]  Status: TC  Submitter: Howard Hinnant  Date: 6 Mar 1999

The title says it all.

Proposed resolution:

-

Insert in 23.3.1 [lib.map], paragraph 2, +

Insert in 23.3.1 [lib.map], paragraph 2, after operator= in the map declaration:

    allocator_type get_allocator() const;
-

134. vector constructors over specified

Section: 23.2.4.1 [lib.vector.cons]  Status: TC  Submitter: Howard Hinnant  Date: 6 Mar 1999

+

134. vector constructors over specified

Section: 23.2.4.1 [lib.vector.cons]  Status: TC  Submitter: Howard Hinnant  Date: 6 Mar 1999

The complexity description says: "It does at most 2N calls to the copy constructor of T and logN reallocations if they are just input iterators ...".

This appears to be overly restrictive, dictating the precise memory/performance tradeoff for the implementor.

Proposed resolution:

-

Change 23.2.4.1 [lib.vector.cons], paragraph 1 to:

+

Change 23.2.4.1 [lib.vector.cons], paragraph 1 to:

-1- Complexity: The constructor template <class InputIterator> vector(InputIterator first, InputIterator last) @@ -3809,7 +3811,7 @@ order logN reallocations if they are just input iterators. is greater than or equal to 2.

-

136. seekp, seekg setting wrong streams?

Section: 27.6.1.3 [lib.istream.unformatted]  Status: WP  Submitter: Howard Hinnant  Date: 6 Mar 1999

+

136. seekp, seekg setting wrong streams?

Section: 27.6.1.3 [lib.istream.unformatted]  Status: WP  Submitter: Howard Hinnant  Date: 6 Mar 1999

I may be misunderstanding the intent, but should not seekg set only the input stream and seekp set only the output stream? The description seems to say that each should set both input and output streams. If @@ -3870,8 +3872,8 @@ This requirement is a bit weird. There's no similar requirement for basic_streambuf<>::seekpos, or for basic_filebuf<>::seekoff or basic_filebuf<>::seekpos.]

-

137. Do use_facet and has_facet look in the global locale?

Section: 22.1.1 [lib.locale]  Status: TC  Submitter: Angelika Langer  Date: 17 Mar 1999

-

Section 22.1.1 [lib.locale] says:

+

137. Do use_facet and has_facet look in the global locale?

Section: 22.1.1 [lib.locale]  Status: TC  Submitter: Angelika Langer  Date: 17 Mar 1999

+

Section 22.1.1 [lib.locale] says:

-4- In the call to use_facet<Facet>(loc), the type argument chooses a facet, making available all members of the named type. If @@ -3881,7 +3883,7 @@ check if a locale implements a particular facet with the template function has_facet<Facet>().

This contradicts the specification given in section -22.1.2 [lib.locale.global.templates]: +22.1.2 [lib.locale.global.templates]:

template <class  Facet> const  Facet& use_facet(const locale&  loc);
@@ -3898,7 +3900,7 @@ from section 22.1.1.

Needed for consistency with the way locales are handled elsewhere in the standard.

-

139. Optional sequence operation table description unclear

Section: 23.1.1 [lib.sequence.reqmts]  Status: TC  Submitter: Andrew Koenig  Date: 30 Mar 1999

+

139. Optional sequence operation table description unclear

Section: 23.1.1 [lib.sequence.reqmts]  Status: TC  Submitter: Andrew Koenig  Date: 30 Mar 1999

The sentence introducing the Optional sequence operation table (23.1.1 paragraph 12) has two problems:

@@ -3921,7 +3923,7 @@ with:

amortized constant time.

-

141. basic_string::find_last_of, find_last_not_of say pos instead of xpos

Section: 21.3.6.4 [lib.string::find.last.of], 21.3.6.6 [lib.string::find.last.not.of]  Status: TC  Submitter: Arch Robison  Date: 28 Apr 1999

+

141. basic_string::find_last_of, find_last_not_of say pos instead of xpos

Section: 21.3.6.4 [lib.string::find.last.of], 21.3.6.6 [lib.string::find.last.not.of]  Status: TC  Submitter: Arch Robison  Date: 28 Apr 1999

Sections 21.3.6.4 paragraph 1 and 21.3.6.6 paragraph 1 surely have misprints where they say:

@@ -3940,7 +3942,7 @@ proposed resolution.]


— xpos <= pos and xpos < size();

-

142. lexicographical_compare complexity wrong

Section: 25.3.8 [lib.alg.lex.comparison]  Status: TC  Submitter: Howard Hinnant  Date: 20 Jun 1999

+

142. lexicographical_compare complexity wrong

Section: 25.3.8 [lib.alg.lex.comparison]  Status: TC  Submitter: Howard Hinnant  Date: 20 Jun 1999

The lexicographical_compare complexity is specified as:

     "At most min((last1 - first1), (last2 - first2)) @@ -3953,7 +3955,7 @@ equality you have to check both < and >? Yes, IMO you are right! (and Matt states this complexity in his book)

Proposed resolution:

-

Change 25.3.8 [lib.alg.lex.comparison] complexity to:

+

Change 25.3.8 [lib.alg.lex.comparison] complexity to:

At most 2*min((last1 - first1), (last2 - first2)) applications of the corresponding comparison. @@ -3973,7 +3975,7 @@ right! (and Matt states this complexity in his book)

--end example]
-

144. Deque constructor complexity wrong

Section: 23.2.1.1 [lib.deque.cons]  Status: TC  Submitter: Herb Sutter  Date: 9 May 1999

+

144. Deque constructor complexity wrong

Section: 23.2.1.1 [lib.deque.cons]  Status: TC  Submitter: Herb Sutter  Date: 9 May 1999

In 23.2.1.1 paragraph 6, the deque ctor that takes an iterator range appears to have complexity requirements which are incorrect, and which contradict the complexity requirements for insert(). I suspect that the text in question, @@ -4004,7 +4006,7 @@ typo):

Complexity: Makes last - first calls to the copy constructor of T.

-

146. complex<T> Inserter and Extractor need sentries

Section: 26.2.6 [lib.complex.ops]  Status: TC  Submitter: Angelika Langer  Date: 12 May 1999

+

146. complex<T> Inserter and Extractor need sentries

Section: 26.2.6 [lib.complex.ops]  Status: TC  Submitter: Angelika Langer  Date: 12 May 1999

The extractor for complex numbers is specified as: 

@@ -4061,7 +4063,7 @@ consistency with the other inserters and extractors in the library. Regarding the issue of padding in the inserter, I don't know what the intent was. 

Proposed resolution:

-

After 26.2.6 [lib.complex.ops] paragraph 14 (operator>>), add a +

After 26.2.6 [lib.complex.ops] paragraph 14 (operator>>), add a Notes clause:

@@ -4078,7 +4080,7 @@ follows an "all-or-none" rule.

For inserters, the LWG believes there is no defect; the standard is correct as written.

-

147. Library Intro refers to global functions that aren't global

Section: 17.4.4.3 [lib.global.functions]  Status: TC  Submitter: Lois Goldthwaite  Date: 4 Jun 1999

+

147. Library Intro refers to global functions that aren't global

Section: 17.4.4.3 [lib.global.functions]  Status: TC  Submitter: Lois Goldthwaite  Date: 4 Jun 1999

The library had many global functions until 17.4.1.1 [lib.contents] paragraph 2 was added:

@@ -4141,22 +4143,22 @@ Because operator new and delete are global, the proposed resolution was changed from "non-member" to "global or non-member.

-

148. Functions in the example facet BoolNames should be const

Section: 22.2.8 [lib.facets.examples]  Status: TC  Submitter: Jeremy Siek  Date: 3 Jun 1999

-

In 22.2.8 [lib.facets.examples] paragraph 13, the do_truename() and +

148. Functions in the example facet BoolNames should be const

Section: 22.2.8 [lib.facets.examples]  Status: TC  Submitter: Jeremy Siek  Date: 3 Jun 1999

+

In 22.2.8 [lib.facets.examples] paragraph 13, the do_truename() and do_falsename() functions in the example facet BoolNames should be const. The functions they are overriding in numpunct_byname<char> are const.

Proposed resolution:

-

In 22.2.8 [lib.facets.examples] paragraph 13, insert "const" in +

In 22.2.8 [lib.facets.examples] paragraph 13, insert "const" in two places:

string do_truename() const { return "Oui Oui!"; }
string do_falsename() const { return "Mais Non!"; }

-

150. Find_first_of says integer instead of iterator

Section: 25.1.4 [lib.alg.find.first.of]  Status: TC  Submitter: Matt McClure  Date: 30 Jun 1999

+

150. Find_first_of says integer instead of iterator

Section: 25.1.4 [lib.alg.find.first.of]  Status: TC  Submitter: Matt McClure  Date: 30 Jun 1999

Proposed resolution:

-

Change 25.1.4 [lib.alg.find.first.of] paragraph 2 from:

+

Change 25.1.4 [lib.alg.find.first.of] paragraph 2 from:

Returns: The first iterator i in the range [first1, last1) such @@ -4170,7 +4172,7 @@ that for some integer j in the range [first2, last2) ...

that for some iterator j in the range [first2, last2) ...

-

151. Can't currently clear() empty container

Section: 23.1.1 [lib.sequence.reqmts]  Status: TC  Submitter: Ed Brey  Date: 21 Jun 1999

+

151. Can't currently clear() empty container

Section: 23.1.1 [lib.sequence.reqmts]  Status: TC  Submitter: Ed Brey  Date: 21 Jun 1999

For both sequences and associative containers, a.clear() has the semantics of erase(a.begin(),a.end()), which is undefined for an empty container since erase(q1,q2) requires that q1 be dereferenceable @@ -4206,13 +4208,13 @@ iterators or certain kinds of iterators is unnecessary. into a

-

152. Typo in scan_is() semantics

Section: 22.2.1.1.2 [lib.locale.ctype.virtuals]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

+

152. Typo in scan_is() semantics

Section: 22.2.1.1.2 [lib.locale.ctype.virtuals]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

The semantics of scan_is() (paragraphs 4 and 6) is not exactly described because there is no function is() which only takes a character as argument. Also, in the effects clause (paragraph 3), the semantic is also kept vague.

Proposed resolution:

-

In 22.2.1.1.2 [lib.locale.ctype.virtuals] paragraphs 4 and 6, change the returns +

In 22.2.1.1.2 [lib.locale.ctype.virtuals] paragraphs 4 and 6, change the returns clause from:

"... such that is(*p) @@ -4221,7 +4223,7 @@ would..."

to:  "... such that is(m, *p) would...."

-

153. Typo in narrow() semantics

Section: 22.2.1.3.2 [lib.facet.ctype.char.members]  Status: WP  Submitter: Dietmar Kühl  Date: 20 Jul 1999

+

153. Typo in narrow() semantics

Section: 22.2.1.3.2 [lib.facet.ctype.char.members]  Status: WP  Submitter: Dietmar Kühl  Date: 20 Jul 1999

The description of the array version of narrow() (in paragraph 11) is flawed: There is no member do_narrow() which takes only three arguments because in addition to the range a default @@ -4232,7 +4234,7 @@ two signatures followed by a Returns clause that only addresses one of them.

Proposed resolution:

-

Change the returns clause in 22.2.1.3.2 [lib.facet.ctype.char.members] +

Change the returns clause in 22.2.1.3.2 [lib.facet.ctype.char.members] paragraph 10 from:

    Returns: do_widen(low, high, to).

@@ -4240,7 +4242,7 @@ paragraph 10 from:

    Returns: do_widen(c) or do_widen(low, high, to), respectively.

-

Change 22.2.1.3.2 [lib.facet.ctype.char.members] paragraph 10 and 11 from:

+

Change 22.2.1.3.2 [lib.facet.ctype.char.members] paragraph 10 and 11 from:

        char        narrow(char c, char /*dfault*/) const;
         const char* narrow(const char* low, const char* high,
                            char /*dfault*/, char* to) const;
@@ -4262,48 +4264,48 @@ version..." comment above. Perhaps it was a circuitous way of saying "dfault" needed to be uncommented?]

[Post-Toronto: the issues list maintainer has merged in the -proposed resolution from issue 207, which addresses the +proposed resolution from issue 207, which addresses the same paragraphs.]

154. Missing double specifier for do_get() -

Section: 22.2.2.1.2 [lib.facet.num.get.virtuals]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

+

Section: 22.2.2.1.2 [lib.facet.num.get.virtuals]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

The table in paragraph 7 for the length modifier does not list the length modifier l to be applied if the type is double. Thus, the standard asks the implementation to do undefined things when using scanf() (the missing length modifier for scanf() when scanning doubles is actually a problem I found quite often in production code, too).

Proposed resolution:

-

In 22.2.2.1.2 [lib.facet.num.get.virtuals], paragraph 7, add a row in the Length +

In 22.2.2.1.2 [lib.facet.num.get.virtuals], paragraph 7, add a row in the Length Modifier table to say that for double a length modifier l is to be used.

Rationale:

The standard makes an embarrassing beginner's mistake.

155. Typo in naming the class defining the class Init -

Section: 27.3 [lib.iostream.objects]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

+

Section: 27.3 [lib.iostream.objects]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

There are conflicting statements about where the class -Init is defined. According to 27.3 [lib.iostream.objects] paragraph 2 -it is defined as basic_ios::Init, according to 27.4.2 [lib.ios.base] it is defined as ios_base::Init.

+Init is defined. According to 27.3 [lib.iostream.objects] paragraph 2 +it is defined as basic_ios::Init, according to 27.4.2 [lib.ios.base] it is defined as ios_base::Init.

Proposed resolution:

-

Change 27.3 [lib.iostream.objects] paragraph 2 from +

Change 27.3 [lib.iostream.objects] paragraph 2 from "basic_ios::Init" to "ios_base::Init".

Rationale:

Although not strictly wrong, the standard was misleading enough to warrant the change.

-

156. Typo in imbue() description

Section: 27.4.2.3 [lib.ios.base.locales]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

+

156. Typo in imbue() description

Section: 27.4.2.3 [lib.ios.base.locales]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

There is a small discrepancy between the declarations of -imbue(): in 27.4.2 [lib.ios.base] the argument is passed as -locale const& (correct), in 27.4.2.3 [lib.ios.base.locales] it +imbue(): in 27.4.2 [lib.ios.base] the argument is passed as +locale const& (correct), in 27.4.2.3 [lib.ios.base.locales] it is passed as locale const (wrong).

Proposed resolution:

-

In 27.4.2.3 [lib.ios.base.locales] change the imbue argument +

In 27.4.2.3 [lib.ios.base.locales] change the imbue argument from "locale const" to "locale const&".

158. Underspecified semantics for setbuf() -

Section: 27.5.2.4.2 [lib.streambuf.virt.buffer]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

+

Section: 27.5.2.4.2 [lib.streambuf.virt.buffer]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

The default behavior of setbuf() is described only for the situation that gptr() != 0 && gptr() != egptr(): namely to do nothing. What has to be done in other situations  @@ -4315,11 +4317,11 @@ buffer management of derived classes unless these classes do it themselves, the default behavior of setbuf() should always be to do nothing.

Proposed resolution:

-

Change 27.5.2.4.2 [lib.streambuf.virt.buffer], paragraph 3, Default behavior, +

Change 27.5.2.4.2 [lib.streambuf.virt.buffer], paragraph 3, Default behavior, to: "Default behavior: Does nothing. Returns this."

-

159. Strange use of underflow() -

Section: 27.5.2.4.3 [lib.streambuf.virt.get]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

+

159. Strange use of underflow() +

Section: 27.5.2.4.3 [lib.streambuf.virt.get]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

The description of the meaning of the result of showmanyc() seems to be rather strange: It uses calls to underflow(). Using underflow() is strange because @@ -4327,19 +4329,19 @@ this function only reads the current character but does not extract it, uflow() would extract the current character. This should be fixed to use sbumpc() instead.

Proposed resolution:

-

Change 27.5.2.4.3 [lib.streambuf.virt.get] paragraph 1, +

Change 27.5.2.4.3 [lib.streambuf.virt.get] paragraph 1, showmanyc()returns clause, by replacing the word "supplied" with the words "extracted from the stream".

160. Typo: Use of non-existing function exception() -

Section: 27.6.1.1 [lib.istream]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

+

Section: 27.6.1.1 [lib.istream]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

The paragraph 4 refers to the function exception() which is not defined. Probably, the referred function is basic_ios<>::exceptions().

Proposed resolution:

-

In 27.6.1.1 [lib.istream], 27.6.1.3 [lib.istream.unformatted], paragraph 1, -27.6.2.1 [lib.ostream], paragraph 3, and 27.6.2.5.1 [lib.ostream.formatted.reqmts], +

In 27.6.1.1 [lib.istream], 27.6.1.3 [lib.istream.unformatted], paragraph 1, +27.6.2.1 [lib.ostream], paragraph 3, and 27.6.2.5.1 [lib.ostream.formatted.reqmts], paragraph 1, change "exception()" to "exceptions()".

@@ -4347,12 +4349,12 @@ paragraph 1, change "exception()" to is the correct spelling.]

161. Typo: istream_iterator vs. istreambuf_iterator -

Section: 27.6.1.2.2 [lib.istream.formatted.arithmetic]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

+

Section: 27.6.1.2.2 [lib.istream.formatted.arithmetic]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

The note in the second paragraph pretends that the first argument is an object of type istream_iterator. This is wrong: It is an object of type istreambuf_iterator.

Proposed resolution:

-

Change 27.6.1.2.2 [lib.istream.formatted.arithmetic] from:

+

Change 27.6.1.2.2 [lib.istream.formatted.arithmetic] from:

The first argument provides an object of the istream_iterator class...

@@ -4361,8 +4363,8 @@ an object of type istreambuf_iterator.

The first argument provides an object of the istreambuf_iterator class...

-

164. do_put() has apparently unused fill argument

Section: 22.2.5.3.2 [lib.locale.time.put.virtuals]  Status: TC  Submitter: Angelika Langer  Date: 23 Jul 1999

-

In 22.2.5.3.2 [lib.locale.time.put.virtuals] the do_put() function is specified +

164. do_put() has apparently unused fill argument

Section: 22.2.5.3.2 [lib.locale.time.put.virtuals]  Status: TC  Submitter: Angelika Langer  Date: 23 Jul 1999

+

In 22.2.5.3.2 [lib.locale.time.put.virtuals] the do_put() function is specified as taking a fill character as an argument, but the description of the function does not say whether the character is used at all and, if so, in which way. The same holds for any format control parameters that @@ -4372,7 +4374,7 @@ character in any way? In any case, the specification of time_put.do_put() looks inconsistent to me.

Is the signature of do_put() wrong, or is the effects clause incomplete?

Proposed resolution:

-

Add the following note after 22.2.5.3.2 [lib.locale.time.put.virtuals] +

Add the following note after 22.2.5.3.2 [lib.locale.time.put.virtuals] paragraph 2:

[Note: the fill argument may be used in the implementation-defined formats, or by derivations. A space character is a reasonable default @@ -4383,7 +4385,7 @@ paragraph 2:

users need some guidance on what to pass for the fill argument since the standard doesn't say how it's used.

-

165. xsputn(), pubsync() never called by basic_ostream members?

Section: 27.6.2.1 [lib.ostream]  Status: WP  Submitter: Dietmar Kühl  Date: 20 Jul 1999

+

165. xsputn(), pubsync() never called by basic_ostream members?

Section: 27.6.2.1 [lib.ostream]  Status: WP  Submitter: Dietmar Kühl  Date: 20 Jul 1999

Paragraph 2 explicitly states that none of the basic_ostream functions falling into one of the groups "formatted output functions" and "unformatted output functions" calls any stream buffer function @@ -4430,7 +4432,7 @@ called from what functions and eg to state specifically that flush() is allowed to call sync() while other functions are not.]

167. Improper use of traits_type::length() -

Section: 27.6.2.5.4 [lib.ostream.inserters.character]  Status: WP  Submitter: Dietmar Kühl  Date: 20 Jul 1999

+

Section: 27.6.2.5.4 [lib.ostream.inserters.character]  Status: WP  Submitter: Dietmar Kühl  Date: 20 Jul 1999

Paragraph 4 states that the length is determined using traits::length(s). Unfortunately, this function is not defined for example if the character type is wchar_t and the @@ -4439,7 +4441,7 @@ the character type is char and the type of s is either signed char const* or unsigned char const*.

Proposed resolution:

-

Change 27.6.2.5.4 [lib.ostream.inserters.character] paragraph 4 from:

+

Change 27.6.2.5.4 [lib.ostream.inserters.character] paragraph 4 from:

Effects: Behaves like an formatted inserter (as described in lib.ostream.formatted.reqmts) of out. After a sentry object is @@ -4494,12 +4496,12 @@ traits class for some arbitrary charT type, and we somehow have to deal with a const char*. There's nothing better to do but fall back to char_traits<char>

-

168. Typo: formatted vs. unformatted

Section: 27.6.2.6 [lib.ostream.unformatted]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

+

168. Typo: formatted vs. unformatted

Section: 27.6.2.6 [lib.ostream.unformatted]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

The first paragraph begins with a descriptions what has to be done in formatted output functions. Probably this is a typo and the paragraph really want to describe unformatted output functions...

Proposed resolution:

-

In 27.6.2.6 [lib.ostream.unformatted] paragraph 1, the first and last +

In 27.6.2.6 [lib.ostream.unformatted] paragraph 1, the first and last sentences, change the word "formatted" to "unformatted":

@@ -4508,18 +4510,18 @@ sentences, change the word "formatted" to function."

-

169. Bad efficiency of overflow() mandated

Section: 27.7.1.3 [lib.stringbuf.virtuals]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

+

169. Bad efficiency of overflow() mandated

Section: 27.7.1.3 [lib.stringbuf.virtuals]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

Paragraph 8, Notes, of this section seems to mandate an extremely inefficient way of buffer handling for basic_stringbuf, especially in view of the restriction that basic_ostream -member functions are not allowed to use xsputn() (see 27.6.2.1 [lib.ostream]): For each character to be inserted, a new buffer +member functions are not allowed to use xsputn() (see 27.6.2.1 [lib.ostream]): For each character to be inserted, a new buffer is to be created.

Of course, the resolution below requires some handling of simultaneous input and output since it is no longer possible to update egptr() whenever epptr() is changed. A possible solution is to handle this in underflow().

Proposed resolution:

-

In 27.7.1.3 [lib.stringbuf.virtuals] paragraph 8, Notes, insert the words +

In 27.7.1.3 [lib.stringbuf.virtuals] paragraph 8, Notes, insert the words "at least" as in the following:

To make a write position available, the function reallocates (or initially @@ -4529,23 +4531,23 @@ solution is to handle this in underflow().

170. Inconsistent definition of traits_type -

Section: 27.7.4 [lib.stringstream]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

-

The classes basic_stringstream (27.7.4 [lib.stringstream]), -basic_istringstream (27.7.2 [lib.istringstream]), and -basic_ostringstream (27.7.3 [lib.ostringstream]) are inconsistent +

Section: 27.7.4 [lib.stringstream]  Status: TC  Submitter: Dietmar Kühl  Date: 20 Jul 1999

+

The classes basic_stringstream (27.7.4 [lib.stringstream]), +basic_istringstream (27.7.2 [lib.istringstream]), and +basic_ostringstream (27.7.3 [lib.ostringstream]) are inconsistent in their definition of the type traits_type: For istringstream, this type is defined, for the other two it is not. This should be consistent.

Proposed resolution:

Proposed resolution:

To the declarations of -basic_ostringstream (27.7.3 [lib.ostringstream]) and -basic_stringstream (27.7.4 [lib.stringstream]) add:

+basic_ostringstream (27.7.3 [lib.ostringstream]) and +basic_stringstream (27.7.4 [lib.stringstream]) add:

typedef traits traits_type;
-

171. Strange seekpos() semantics due to joint position

Section: 27.8.1.4 [lib.filebuf.virtuals]  Status: WP  Submitter: Dietmar Kühl  Date: 20 Jul 1999

-

Overridden virtual functions, seekpos()

In 27.8.1.1 [lib.filebuf] paragraph 3, it is stated that a joint input and +

171. Strange seekpos() semantics due to joint position

Section: 27.8.1.4 [lib.filebuf.virtuals]  Status: WP  Submitter: Dietmar Kühl  Date: 20 Jul 1999

+

Overridden virtual functions, seekpos()

In 27.8.1.1 [lib.filebuf] paragraph 3, it is stated that a joint input and output position is maintained by basic_filebuf. Still, the description of seekpos() seems to talk about different file positions. In particular, it is unclear (at least to me) what is @@ -4597,17 +4599,17 @@ paragraph 14 from:

[Post-Tokyo: Dietmar supplied the above wording.]

172. Inconsistent types for basic_istream::ignore() -

Section: 27.6.1.3 [lib.istream.unformatted]  Status: TC  Submitter: Greg Comeau, Dietmar Kühl  Date: 23 Jul 1999

-

In 27.6.1.1 [lib.istream] the function +

Section: 27.6.1.3 [lib.istream.unformatted]  Status: TC  Submitter: Greg Comeau, Dietmar Kühl  Date: 23 Jul 1999

+

In 27.6.1.1 [lib.istream] the function ignore() gets an object of type streamsize as first -argument. However, in 27.6.1.3 [lib.istream.unformatted] +argument. However, in 27.6.1.3 [lib.istream.unformatted] paragraph 23 the first argument is of type int.

As far as I can see this is not really a contradiction because everything is consistent if streamsize is typedef to be int. However, this is almost certainly not what was intended. The same thing happened to basic_filebuf::setbuf(), -as described in issue 173.

+as described in issue 173.

Darin Adler also submitted this issue, commenting: Either 27.6.1.1 should be modified @@ -4615,17 +4617,17 @@ to show a first parameter of type int, or 27.6.1.3 should be modified to show a first parameter of type streamsize and use numeric_limits<streamsize>::max.

Proposed resolution:

-

In 27.6.1.3 [lib.istream.unformatted] paragraph 23 and 24, change both uses +

In 27.6.1.3 [lib.istream.unformatted] paragraph 23 and 24, change both uses of int in the description of ignore() to streamsize.

173. Inconsistent types for basic_filebuf::setbuf() -

Section: 27.8.1.4 [lib.filebuf.virtuals]  Status: TC  Submitter: Greg Comeau, Dietmar Kühl  Date: 23 Jul 1999

+

Section: 27.8.1.4 [lib.filebuf.virtuals]  Status: TC  Submitter: Greg Comeau, Dietmar Kühl  Date: 23 Jul 1999

-In 27.8.1.1 [lib.filebuf] the function setbuf() gets an +In 27.8.1.1 [lib.filebuf] the function setbuf() gets an object of type streamsize as second argument. However, in -27.8.1.4 [lib.filebuf.virtuals] paragraph 9 the second argument is of type +27.8.1.4 [lib.filebuf.virtuals] paragraph 9 the second argument is of type int.

@@ -4634,25 +4636,25 @@ As far as I can see this is not really a contradiction because everything is consistent if streamsize is typedef to be int. However, this is almost certainly not what was intended. The same thing happened to basic_istream::ignore(), -as described in issue 172. +as described in issue 172.

Proposed resolution:

-

In 27.8.1.4 [lib.filebuf.virtuals] paragraph 9, change all uses of +

In 27.8.1.4 [lib.filebuf.virtuals] paragraph 9, change all uses of int in the description of setbuf() to streamsize.

174. Typo: OFF_T vs. POS_T -

Section: D.6 [depr.ios.members]  Status: TC  Submitter: Dietmar Kühl  Date: 23 Jul 1999

+

Section: D.6 [depr.ios.members]  Status: TC  Submitter: Dietmar Kühl  Date: 23 Jul 1999

According to paragraph 1 of this section, streampos is the type OFF_T, the same type as streamoff. However, in paragraph 6 the streampos gets the type POS_T

Proposed resolution:

-

Change D.6 [depr.ios.members] paragraph 1 from "typedef +

Change D.6 [depr.ios.members] paragraph 1 from "typedef OFF_T streampos;" to "typedef POS_T streampos;"

-

175. Ambiguity for basic_streambuf::pubseekpos() and a few other functions.

Section: D.6 [depr.ios.members]  Status: TC  Submitter: Dietmar Kühl  Date: 23 Jul 1999

+

175. Ambiguity for basic_streambuf::pubseekpos() and a few other functions.

Section: D.6 [depr.ios.members]  Status: TC  Submitter: Dietmar Kühl  Date: 23 Jul 1999

According to paragraph 8 of this section, the methods basic_streambuf::pubseekpos(), basic_ifstream::open(), and basic_ofstream::open @@ -4665,23 +4667,23 @@ three cases. However, this generates an ambiguity with the overloaded version because now the arguments are absolutely identical if the last argument is not specified.

Proposed resolution:

-

In D.6 [depr.ios.members] paragraph 8, remove the default arguments for +

In D.6 [depr.ios.members] paragraph 8, remove the default arguments for basic_streambuf::pubseekpos(), basic_ifstream::open(), and basic_ofstream::open().

-

176. exceptions() in ios_base...?

Section: D.6 [depr.ios.members]  Status: TC  Submitter: Dietmar Kühl  Date: 23 Jul 1999

+

176. exceptions() in ios_base...?

Section: D.6 [depr.ios.members]  Status: TC  Submitter: Dietmar Kühl  Date: 23 Jul 1999

The "overload" for the function exceptions() in paragraph 8 gives the impression that there is another function of this function defined in class ios_base. However, this is not the case. Thus, it is hard to tell how the semantics (paragraph 9) can be implemented: "Call the corresponding member function specified -in clause 27 [lib.input.output]."

+in clause 27 [lib.input.output]."

Proposed resolution:

-

In D.6 [depr.ios.members] paragraph 8, move the declaration of the +

In D.6 [depr.ios.members] paragraph 8, move the declaration of the function exceptions()into class basic_ios.

-

179. Comparison of const_iterators to iterators doesn't work

Section: 23.1 [lib.container.requirements]  Status: WP  Submitter: Judy Ward  Date: 2 Jul 1998

+

179. Comparison of const_iterators to iterators doesn't work

Section: 23.1 [lib.container.requirements]  Status: WP  Submitter: Judy Ward  Date: 2 Jul 1998

Currently the following will not compile on two well-known standard library implementations:

@@ -4754,7 +4756,7 @@ return i == ci;

Proposed resolution:

-

Insert this paragraph after 23.1 [lib.container.requirements] paragraph 7:

+

Insert this paragraph after 23.1 [lib.container.requirements] paragraph 7:

In the expressions

    i == j
@@ -4785,10 +4787,10 @@ the nested types X::iterator and X::const_iterator,
 where X is a container.  There is no requirement that
 X::reverse_iterator and X::const_reverse_iterator
 can be mixed.  If mixing them is considered important, that's a
-separate issue.  (Issue 280.)
+separate issue.  (Issue 280.)
 

 

-
181. make_pair() unintended behavior
Section: 20.2.2  [lib.pairs]  Status: TC  Submitter: Andrew Koenig  Date: 3 Aug 1999

+
181. make_pair() unintended behavior
Section: 20.2.2  [lib.pairs]  Status: TC  Submitter: Andrew Koenig  Date: 3 Aug 1999

 
The claim has surfaced in Usenet that expressions such as

 

        make_pair("abc", 3)

@@ -4799,7 +4801,7 @@ parameter to  const char (&)[4], which type is uncopyable.

 I doubt anyone intended that behavior...
 

 
Proposed resolution:

-
In 20.2  [lib.utility], paragraph 1 change the following
+
In 20.2  [lib.utility], paragraph 1 change the following
 declaration of make_pair():

 

   
template <class T1, class T2> pair<T1,T2> make_pair(const T1&, const T2&);

@@ -4808,7 +4810,7 @@ declaration of make_pair():

 

   
template <class T1, class T2> pair<T1,T2> make_pair(T1, T2);

 

-
  In 20.2.2  [lib.pairs] paragraph 7 and the line before, change:

+
  In 20.2.2  [lib.pairs] paragraph 7 and the line before, change:

 

 
template <class T1, class T2>
 pair<T1, T2> make_pair(const T1& x, const T2& y);

@@ -4834,10 +4836,10 @@ suggestions, and any efficiency concerns were more than offset by the
 advantages of the solution. Two implementors reported that the
 proposed resolution passed their test suites.

 

-
182. Ambiguous references to size_t
Section: 17  [lib.library]  Status: WP  Submitter: Al Stevens  Date: 15 Aug 1999

+
182. Ambiguous references to size_t
Section: 17  [lib.library]  Status: WP  Submitter: Al Stevens  Date: 15 Aug 1999

 
Many references to  size_t throughout the document
 omit the  std:: namespace qualification.
 
For
-example, 17.4.3.4  [lib.replacement.functions] paragraph 2:

+example, 17.4.3.4  [lib.replacement.functions] paragraph 2:

 

 
— operator new(size_t)
 — operator new(size_t, const std::nothrow_t&)
@@ -4845,7 +4847,7 @@ example, 17.4.3.4  [lib.replacement.functions] paragraph 2: replace:

+
   In 17.4.3.4  [lib.replacement.functions] paragraph 2: replace:

 

 
     - operator new(size_t)

      - operator new(size_t, const std::nothrow_t&)

@@ -4920,7 +4922,7 @@ declaration of template <class charT> class ctype.

 
The LWG believes correcting names like size_t and
 ptrdiff_t to std::size_t and std::ptrdiff_t
 to be essentially editorial.  There there can't be another size_t or
-ptrdiff_t meant anyway because, according to 17.4.3.1.4  [lib.extern.types],

+ptrdiff_t meant anyway because, according to 17.4.3.1.4  [lib.extern.types],

 
 

 For each type T from the Standard C library, the types ::T and std::T
@@ -4934,7 +4936,7 @@ Editor's authority to make this change.

 
[Post-Tokyo: Nico Josuttis provided the above wording at the
 request of the LWG.]

 
-
[Toronto: This is tangentially related to issue 229, but only tangentially: the intent of this issue is to
+
[Toronto: This is tangentially related to issue 229, but only tangentially: the intent of this issue is to
 address use of the name size_t in contexts outside of
 namespace std, such as in the description of ::operator new.
 The proposed changes should be reviewed to make sure they are
@@ -4944,8 +4946,8 @@ correct.]

 them to be correct.]

 
 

-
183. I/O stream manipulators don't work for wide character streams
Section: 27.6.3  [lib.std.manip]  Status: WP  Submitter: Andy Sawyer  Date: 7 Jul 1999

-
27.6.3  [lib.std.manip] paragraph 3 says (clause numbering added for
+
183. I/O stream manipulators don't work for wide character streams
Section: 27.6.3  [lib.std.manip]  Status: WP  Submitter: Andy Sawyer  Date: 7 Jul 1999

+
27.6.3  [lib.std.manip] paragraph 3 says (clause numbering added for
 exposition):

 

 
Returns: An object s of unspecified type such that if [1] out is an (instance
@@ -4973,7 +4975,7 @@ ostreams.

 that the value of the expression is "the same specialization of
 basic_ostream as out"&

 
Proposed resolution:

-
Replace section 27.6.3  [lib.std.manip] except paragraph 1 with the
+
Replace section 27.6.3  [lib.std.manip] except paragraph 1 with the
 following:

 

 
2- The type designated smanip in each of the following function
@@ -5119,19 +5121,19 @@ in.
 
[Kona: Andy Sawyer and Beman Dawes will work to improve the wording of
 the proposed resolution.]

 
-
[Tokyo - The LWG noted that issue 216 involves
+
[Tokyo - The LWG noted that issue 216 involves
 the same paragraphs.]

 
 
[Post-Tokyo: The issues list maintainer combined the proposed
-resolution of this issue with the proposed resolution for issue 216 as they both involved the same paragraphs, and were so
+resolution of this issue with the proposed resolution for issue 216 as they both involved the same paragraphs, and were so
 intertwined that dealing with them separately appear fraught with
 error.  The full text was supplied by Bill Plauger; it was cross
 checked against changes supplied by Andy Sawyer. It should be further
 checked by the LWG.]

 

-
184. numeric_limits<bool> wording problems
Section: 18.2.1.5  [lib.numeric.special]  Status: WP  Submitter: Gabriel Dos Reis  Date: 21 Jul 1999

+
184. numeric_limits<bool> wording problems
Section: 18.2.1.5  [lib.numeric.special]  Status: WP  Submitter: Gabriel Dos Reis  Date: 21 Jul 1999

 
bools are defined by the standard to be of integer types, as per
-3.9.1  [basic.fundamental] paragraph 7.  However "integer types"
+3.9.1  [basic.fundamental] paragraph 7.  However "integer types"
 seems to have a special meaning for the author of 18.2. The net effect
 is an unclear and confusing specification for
 numeric_limits<bool> as evidenced below.

@@ -5169,7 +5171,7 @@ types with base representation other than 2.

 
Furthermore, numeric_limits<bool>::is_modulo and
 numeric_limits<bool>::is_signed have similar problems.

 
Proposed resolution:

-
Append to the end of 18.2.1.5  [lib.numeric.special]:

+
Append to the end of 18.2.1.5  [lib.numeric.special]:

 

   
The specialization for bool shall be provided as follows:

   
    namespace std {
@@ -5221,8 +5223,8 @@ resolution.]

 
[Post-Tokyo:  At the request of the LWG in Tokyo, Nico
 Josuttis provided the above wording.]

 

-
185. Questionable use of term "inline"
Section: 20.3  [lib.function.objects]  Status: WP  Submitter: UK Panel  Date: 26 Jul 1999

-
Paragraph 4 of 20.3  [lib.function.objects] says:

+
185. Questionable use of term "inline"
Section: 20.3  [lib.function.objects]  Status: WP  Submitter: UK Panel  Date: 26 Jul 1999

+
Paragraph 4 of 20.3  [lib.function.objects] says:

 

   
 [Example: To negate every element of a: transform(a.begin(), a.end(),
   a.begin(), negate<double>()); The corresponding functions will inline
@@ -5247,17 +5249,17 @@ any "inlining" will take place in this case.

 
Thus the example "mandates" behavior that is explicitly
 not required elsewhere.

 
Proposed resolution:

-
In 20.3  [lib.function.objects] paragraph 1, remove the sentence:

+
In 20.3  [lib.function.objects] paragraph 1, remove the sentence:

 

 
They are important for the effective use of the library.

 

-
Remove 20.3  [lib.function.objects] paragraph 2, which reads:

+
Remove 20.3  [lib.function.objects] paragraph 2, which reads:

 

   
 Using function objects together with function templates
   increases the expressive power of the library as well as making the
   resulting code much more efficient.

 

-
In 20.3  [lib.function.objects] paragraph 4, remove the sentence:

+
In 20.3  [lib.function.objects] paragraph 4, remove the sentence:

 

   
The corresponding functions will inline the addition and the
   negation.

@@ -5266,8 +5268,8 @@ not required elsewhere.

 
[Kona: The LWG agreed there was a defect.]

 
[Tokyo: The LWG crafted the proposed resolution.]

 

-
186. bitset::set() second parameter should be bool
Section: 23.3.5.2  [lib.bitset.members]  Status: WP  Submitter: Darin Adler  Date: 13 Aug 1999

-
In section 23.3.5.2  [lib.bitset.members], paragraph 13 defines the
+
186. bitset::set() second parameter should be bool
Section: 23.3.5.2  [lib.bitset.members]  Status: WP  Submitter: Darin Adler  Date: 13 Aug 1999

+
In section 23.3.5.2  [lib.bitset.members], paragraph 13 defines the
 bitset::set operation to take a second parameter of type int. The
 function tests whether this value is non-zero to determine whether to
 set the bit to true or false. The type of this second parameter should
@@ -5277,7 +5279,7 @@ possible to slice an integer that's larger than an int. This can't
 happen with bool, since conversion to bool has the semantic of
 translating 0 to false and any non-zero value to true.

 
Proposed resolution:

-
In 23.3.5  [lib.template.bitset] Para 1 Replace:

+
In 23.3.5  [lib.template.bitset] Para 1 Replace:

 

 
bitset<N>& set(size_t pos, int val = true ); 

 

@@ -5285,7 +5287,7 @@ translating 0 to false and any non-zero value to true.

 

   
bitset<N>& set(size_t pos, bool val = true );

 

-
In 23.3.5.2  [lib.bitset.members] Para 12(.5) Replace:

+
In 23.3.5.2  [lib.bitset.members] Para 12(.5) Replace:

 

   
bitset<N>& set(size_t pos, int val = 1 );

 

@@ -5304,7 +5306,7 @@ usually implemented as inline, and because it is already
 the case that users cannot rely on the type of a pointer to a
 nonvirtual member of a standard library class.

 

-
187. iter_swap underspecified
Section: 25.2.2  [lib.alg.swap]  Status: WP  Submitter: Andrew Koenig  Date: 14 Aug 1999

+
187. iter_swap underspecified
Section: 25.2.2  [lib.alg.swap]  Status: WP  Submitter: Andrew Koenig  Date: 14 Aug 1999

 
The description of iter_swap in 25.2.2 paragraph 7,says that it
 ``exchanges the values'' of the objects to which two iterators
 refer.
 
 What it doesn't say is whether it does so using swap
@@ -5360,7 +5362,7 @@ much more than exchanging the two iterators' values: it would change
 predecessor/successor relationships, possibly moving the iterator from
 one list to another.  That would surely be inappropriate.

 

-
189. setprecision() not specified correctly
Section: 27.4.2.2  [lib.fmtflags.state]  Status: TC  Submitter: Andrew Koenig  Date: 25 Aug 1999

+
189. setprecision() not specified correctly
Section: 27.4.2.2  [lib.fmtflags.state]  Status: TC  Submitter: Andrew Koenig  Date: 25 Aug 1999

 
27.4.2.2 paragraph 9 claims that setprecision() sets the precision,
 and includes a parenthetical note saying that it is the number of
 digits after the decimal point.

@@ -5373,10 +5375,10 @@ point.

 I would like the committee to look at the definition carefully and
 correct the statement in 27.4.2.2

 
Proposed resolution:

-
Remove from 27.4.2.2  [lib.fmtflags.state], paragraph 9, the text
+
Remove from 27.4.2.2  [lib.fmtflags.state], paragraph 9, the text
 "(number of digits after the decimal point)".

 

-
193. Heap operations description incorrect
Section: 25.3.6  [lib.alg.heap.operations]  Status: TC  Submitter: Markus Mauhart  Date: 24 Sep 1999

+
193. Heap operations description incorrect
Section: 25.3.6  [lib.alg.heap.operations]  Status: TC  Submitter: Markus Mauhart  Date: 24 Sep 1999

 
25.3.6 [lib.alg.heap.operations] states two key properties of a heap [a,b), the first of them
 is

 

@@ -5395,7 +5397,7 @@ could not be used for a priority queue as explained in 23.2.3.2.2
 priority AND time).

 

 
Proposed resolution:

-
Change 25.3.6  [lib.alg.heap.operations] property (1) from:

+
Change 25.3.6  [lib.alg.heap.operations] property (1) from:

 

   
(1) *a is the largest element

 

@@ -5404,16 +5406,16 @@ priority AND time).

   
(1) There is no element greater than *a

 

 

-
195. Should basic_istream::sentry's constructor ever set eofbit?
Section: 27.6.1.1.2  [lib.istream::sentry]  Status: TC  Submitter: Matt Austern  Date: 13 Oct 1999

+
195. Should basic_istream::sentry's constructor ever set eofbit?
Section: 27.6.1.1.2  [lib.istream::sentry]  Status: TC  Submitter: Matt Austern  Date: 13 Oct 1999

 
Suppose that is.flags() & ios_base::skipws is nonzero.
 What should basic_istream<>::sentry's constructor do if it
 reaches eof while skipping whitespace?  27.6.1.1.2/5 suggests it
 should set failbit. Should it set eofbit as well?  The standard
 doesn't seem to answer that question.

 
-
On the one hand, nothing in 27.6.1.1.2  [lib.istream::sentry] says that
+
On the one hand, nothing in 27.6.1.1.2  [lib.istream::sentry] says that
 basic_istream<>::sentry should ever set eofbit.  On the
-other hand, 27.6.1.1  [lib.istream] paragraph 4 says that if
+other hand, 27.6.1.1  [lib.istream] paragraph 4 says that if
 extraction from a streambuf "returns
 traits::eof(), then the input function, except as explicitly
 noted otherwise, completes its actions and does
@@ -5452,7 +5454,7 @@ returns traits::eof(), the function calls
 

 

 

-
198. Validity of pointers and references unspecified after iterator destruction
Section: 24.1  [lib.iterator.requirements]  Status: WP  Submitter: Beman Dawes  Date: 3 Nov 1999

+
198. Validity of pointers and references unspecified after iterator destruction
Section: 24.1  [lib.iterator.requirements]  Status: WP  Submitter: Beman Dawes  Date: 3 Nov 1999

 

 Is a pointer or reference obtained from an iterator still valid after
 destruction of the iterator?
@@ -5499,14 +5501,14 @@ elements of containers.

 
 
The standard itself assumes that pointers and references obtained
 from an iterator are still valid after iterator destruction or
-change. The definition of reverse_iterator::operator*(), 24.4.1.3.3  [lib.reverse.iter.op.star], which returns a reference, defines
+change. The definition of reverse_iterator::operator*(), 24.4.1.3.3  [lib.reverse.iter.op.star], which returns a reference, defines
 effects:

 
 

   
Iterator tmp = current;
 return *--tmp;

 

-
The definition of reverse_iterator::operator->(), 24.4.1.3.4  [lib.reverse.iter.opref], which returns a pointer, defines effects:

+
The definition of reverse_iterator::operator->(), 24.4.1.3.4  [lib.reverse.iter.opref], which returns a pointer, defines effects:

 

   
return &(operator*());

 

@@ -5517,13 +5519,13 @@ explicitly. This will also reduce the chance of user code breaking
 unexpectedly when porting to a different standard library
 implementation.

 
Proposed resolution:

-
Add a new paragraph to 24.1  [lib.iterator.requirements]:

+
Add a new paragraph to 24.1  [lib.iterator.requirements]:

 

 Destruction of an iterator may invalidate pointers and references
 previously obtained from that iterator.
 

 
-
Replace paragraph 1 of 24.4.1.3.3  [lib.reverse.iter.op.star] with:

+
Replace paragraph 1 of 24.4.1.3.3  [lib.reverse.iter.op.star] with:

 
 

 
Effects:

@@ -5536,7 +5538,7 @@ previously obtained from that iterator.
 [Note: This operation must use an auxiliary member variable,
 rather than a temporary variable, to avoid returning a reference that
 persists beyond the lifetime of its associated iterator.  (See
-24.1  [lib.iterator.requirements].)  The name of this member variable is shown for
+24.1  [lib.iterator.requirements].)  The name of this member variable is shown for
 exposition only.  --end note]
 

 

@@ -5552,7 +5554,7 @@ reformulated yet again to reflect this reality.]

 assumes its underlying iterator has persistent pointers and
 references.  Andy Koenig pointed out that it is possible to rewrite
 reverse_iterator so that it no longer makes such an assupmption.
-However, this issue is related to issue 299.  If we
+However, this issue is related to issue 299.  If we
 decide it is intentional that p[n] may return by value
 instead of reference when p is a Random Access Iterator,
 other changes in reverse_iterator will be necessary.]

@@ -5575,7 +5577,7 @@ Clause 23 should be reviewed to make sure that guarantees for
 predefined iterators are as strong as users expect.

 
 

-
199. What does allocate(0) return?
Section: 20.1.5  [lib.allocator.requirements]  Status: TC  Submitter: Matt Austern  Date: 19 Nov 1999

+
199. What does allocate(0) return?
Section: 20.1.5  [lib.allocator.requirements]  Status: TC  Submitter: Matt Austern  Date: 19 Nov 1999

 

 Suppose that A is a class that conforms to the
 Allocator requirements of Table 32, and a is an
@@ -5597,7 +5599,7 @@ representation.  Since this already implies special case code, it
 would be over-specification to mandate the return value.
 

 

-
200. Forward iterator requirements don't allow constant iterators
Section: 24.1.3  [lib.forward.iterators]  Status: WP  Submitter: Matt Austern  Date: 19 Nov 1999

+
200. Forward iterator requirements don't allow constant iterators
Section: 24.1.3  [lib.forward.iterators]  Status: WP  Submitter: Matt Austern  Date: 19 Nov 1999

 

 In table 74, the return type of the expression *a is given
 as T&, where T is the iterator's value type.
@@ -5619,7 +5621,7 @@ otherwise const U&".
 
[Tokyo: The LWG believes this is the tip of a larger iceberg;
 there are multiple const problems with the STL portion of the library
 and that these should be addressed as a single package.  Note
-that issue 180 has already been declared NAD Future for
+that issue 180 has already been declared NAD Future for
 that very reason.]

 
 
[Redmond: the LWG thinks this is separable from other constness
@@ -5629,7 +5631,7 @@ modified: the original version only discussed *a.  It was pointed out
 that we also need to worry about *r++ and a->m.]

 
 

-
202. unique() effects unclear when predicate not an equivalence relation
Section: 25.2.8  [lib.alg.unique]  Status: WP  Submitter: Andrew Koenig  Date: 13 Jan 2000

+
202. unique() effects unclear when predicate not an equivalence relation
Section: 25.2.8  [lib.alg.unique]  Status: WP  Submitter: Andrew Koenig  Date: 13 Jan 2000

 

 What should unique() do if you give it a predicate that is not an
 equivalence relation?  There are at least two plausible answers:
@@ -5696,7 +5698,7 @@ In fact, the SGI implementation of unique() does neither: It yields 1,
 3, 7.
 

 
Proposed resolution:

-
Change 25.2.8  [lib.alg.unique] paragraph 1 to:

+
Change 25.2.8  [lib.alg.unique] paragraph 1 to:

 

 For a nonempty range, eliminates all but the first element from every
 consecutive group of equivalent elements referred to by the iterator
@@ -5727,7 +5729,7 @@ require another round of review.]

 
 
Rationale:

 
The LWG also considered an alternative resolution: change 
-25.2.8  [lib.alg.unique] paragraph 1 to:

+25.2.8  [lib.alg.unique] paragraph 1 to:

 
 

 For a nonempty range, eliminates all but the first element from every
@@ -5750,7 +5752,7 @@ that the behavior of unique() for a non-equivalence relation is
 specified.  Both resolutions are consistent with the behavior of
 existing implementations.

 

-
208. Unnecessary restriction on past-the-end iterators
Section: 24.1  [lib.iterator.requirements]  Status: TC  Submitter: Stephen Cleary  Date: 02 Feb 2000

+
208. Unnecessary restriction on past-the-end iterators
Section: 24.1  [lib.iterator.requirements]  Status: TC  Submitter: Stephen Cleary  Date: 02 Feb 2000

 
In 24.1 paragraph 5, it is stated ". . . Dereferenceable and
 past-the-end values are always non-singular."

 
This places an unnecessary restriction on past-the-end iterators for
@@ -5762,7 +5764,7 @@ without a "footer" node.

 
This would have an impact on existing code that expects past-the-end
 iterators obtained from different (generic) containers being not equal.

 
Proposed resolution:

-
Change 24.1  [lib.iterator.requirements] paragraph 5, the last sentence, from:

+
Change 24.1  [lib.iterator.requirements] paragraph 5, the last sentence, from:

 

 
Dereferenceable and past-the-end values are always non-singular.

 

@@ -5776,8 +5778,8 @@ zero-length vectors, null pointers are perfectly reasonable past-the-end
 iterators.  Null pointers are singular.
 

 

-
209. basic_string declarations inconsistent
Section: 21.3  [lib.basic.string]  Status: TC  Submitter: Igor Stauder  Date: 11 Feb 2000

-
In Section 21.3  [lib.basic.string] the basic_string member function
+
209. basic_string declarations inconsistent
Section: 21.3  [lib.basic.string]  Status: TC  Submitter: Igor Stauder  Date: 11 Feb 2000

+
In Section 21.3  [lib.basic.string] the basic_string member function
 declarations use a consistent style except for the following functions:

 

   
void push_back(const charT);
@@ -5790,7 +5792,7 @@ not by reference - should be charT or const charT& )

 - swap: redundant use of template parameters in argument
 basic_string<charT,traits,Allocator>&

 
Proposed resolution:

-
In Section 21.3  [lib.basic.string] change the basic_string member
+
In Section 21.3  [lib.basic.string] change the basic_string member
 function declarations push_back, assign, and swap to:

 

   
void push_back(charT c); 
@@ -5805,8 +5807,8 @@ above.  The LWG felt that this was sufficient reason to merit the
 change.
 

 

-
210. distance first and last confused
Section: 25  [lib.algorithms]  Status: TC  Submitter: Lisa Lippincott  Date: 15 Feb 2000

-
In paragraph 9 of section 25  [lib.algorithms], it is written:

+
210. distance first and last confused
Section: 25  [lib.algorithms]  Status: TC  Submitter: Lisa Lippincott  Date: 15 Feb 2000

+
In paragraph 9 of section 25  [lib.algorithms], it is written:

 

   
      In the description of the algorithms operators + and - are used
            for some of the iterator categories for which they do not have to
@@ -5816,14 +5818,14 @@ change.
        return distance(a, b);

 

 
Proposed resolution:

-
On the last line of paragraph 9 of section 25  [lib.algorithms] change
+
On the last line of paragraph 9 of section 25  [lib.algorithms] change
 "a-b" to "b-a".

 
Rationale:

 
There are two ways to fix the defect; change the description to b-a
 or change the return to distance(b,a).  The LWG preferred the
 former for consistency.

 

-
211. operator>>(istream&, string&) doesn't set failbit
Section: 21.3.7.9  [lib.string.io]  Status: TC  Submitter: Scott Snyder  Date: 4 Feb 2000

+
211. operator>>(istream&, string&) doesn't set failbit
Section: 21.3.7.9  [lib.string.io]  Status: TC  Submitter: Scott Snyder  Date: 4 Feb 2000

 
The description of the stream extraction operator for std::string (section
 21.3.7.9 [lib.string.io]) does not contain a requirement that failbit be set in
 the case that the operator fails to extract any characters from the input
@@ -5837,12 +5839,12 @@ while (is >> str) ... ;

 

 
(which tests failbit) is not required to terminate at EOF.

 
Furthermore, this is inconsistent with other extraction operators,
-which do include this requirement. (See sections 27.6.1.2  [lib.istream.formatted] and 27.6.1.3  [lib.istream.unformatted]), where this
+which do include this requirement. (See sections 27.6.1.2  [lib.istream.formatted] and 27.6.1.3  [lib.istream.unformatted]), where this
 requirement is present, either explicitly or implicitly, for the
 extraction operators. It is also present explicitly in the description
-of getline (istream&, string&, charT) in section 21.3.7.9  [lib.string.io] paragraph 8.)

+of getline (istream&, string&, charT) in section 21.3.7.9  [lib.string.io] paragraph 8.)

 
Proposed resolution:

-
Insert new paragraph after paragraph 2 in section 21.3.7.9  [lib.string.io]:

+
Insert new paragraph after paragraph 2 in section 21.3.7.9  [lib.string.io]:

 

 
 
If the function extracts no characters, it calls
@@ -5850,13 +5852,13 @@ is.setstate(ios::failbit) which may throw ios_base::failure
 (27.4.4.3).

 

 

-
212. Empty range behavior unclear for several algorithms
Section: 25.3.7  [lib.alg.min.max]  Status: TC  Submitter: Nico Josuttis  Date: 26 Feb 2000

+
212. Empty range behavior unclear for several algorithms
Section: 25.3.7  [lib.alg.min.max]  Status: TC  Submitter: Nico Josuttis  Date: 26 Feb 2000

 
The standard doesn't specify what min_element() and max_element() shall
 return if the range is empty (first equals last). The usual implementations
 return last. This problem seems also apply to partition(), stable_partition(),
 next_permutation(), and prev_permutation().

 
Proposed resolution:

-
In 25.3.7  [lib.alg.min.max] - Minimum and maximum, paragraphs 7 and
+
In 25.3.7  [lib.alg.min.max] - Minimum and maximum, paragraphs 7 and
 9, append: Returns last if first==last.

 
Rationale:

 
The LWG looked in some detail at all of the above mentioned
@@ -5864,7 +5866,7 @@ algorithms, but believes that except for min_element() and
 max_element() it is already clear that last is returned if first ==
 last.

 

-
214. set::find() missing const overload
Section: 23.3.3  [lib.set], 23.3.4  [lib.multiset]  Status: WP  Submitter: Judy Ward  Date: 28 Feb 2000

+
214. set::find() missing const overload
Section: 23.3.3  [lib.set], 23.3.4  [lib.multiset]  Status: WP  Submitter: Judy Ward  Date: 28 Feb 2000

 
The specification for the associative container requirements in
 Table 69 state that the find member function should "return
 iterator; const_iterator for constant a". The map and multimap
@@ -5875,7 +5877,7 @@ and multiset do not, all they have is:

 

 
Proposed resolution:

 
Change the prototypes for find(), lower_bound(), upper_bound(), and
-equal_range() in section 23.3.3  [lib.set] and section 23.3.4  [lib.multiset] to each have two overloads:

+equal_range() in section 23.3.3  [lib.set] and section 23.3.4  [lib.multiset] to each have two overloads:

 

   
iterator find(const key_type & x);
 const_iterator find(const key_type & x) const;

@@ -5891,7 +5893,7 @@ pair<const_iterator, const_iterator> equal_range(const key_type & x) c
 extending the proposed resolution to lower_bound, upper_bound, and
 equal_range.]

 

-
217. Facets example (Classifying Japanese characters) contains errors
Section: 22.2.8  [lib.facets.examples]  Status: TC  Submitter: Martin Sebor  Date: 29 Feb 2000

+
217. Facets example (Classifying Japanese characters) contains errors
Section: 22.2.8  [lib.facets.examples]  Status: TC  Submitter: Martin Sebor  Date: 29 Feb 2000

 
The example in 22.2.8, paragraph 11 contains the following errors:

 
1) The member function `My::JCtype::is_kanji()' is non-const; the function
 must be const in order for it to be callable on a const object (a reference to
@@ -5934,7 +5936,7 @@ declared above.

     return 0;
 }
-

220. ~ios_base() usage valid?

Section: 27.4.2.7 [lib.ios.base.cons]  Status: TC  Submitter: Jonathan Schilling, Howard Hinnant  Date: 13 Mar 2000

+

220. ~ios_base() usage valid?

Section: 27.4.2.7 [lib.ios.base.cons]  Status: TC  Submitter: Jonathan Schilling, Howard Hinnant  Date: 13 Mar 2000

The pre-conditions for the ios_base destructor are described in 27.4.2.7 paragraph 2:

@@ -5976,7 +5978,7 @@ basic_ios::init. If an ios_base object is destroyed before these initializations have taken place, the behavior is undefined.

-

221. num_get<>::do_get stage 2 processing broken

Section: 22.2.2.1.2 [lib.facet.num.get.virtuals]  Status: WP  Submitter: Matt Austern  Date: 14 Mar 2000

+

221. num_get<>::do_get stage 2 processing broken

Section: 22.2.2.1.2 [lib.facet.num.get.virtuals]  Status: WP  Submitter: Matt Austern  Date: 14 Mar 2000

Stage 2 processing of numeric conversion is broken.

Table 55 in 22.2.2.1.2 says that when basefield is 0 the integral @@ -6009,7 +6011,7 @@ This technique has the consequence that alternate representations of digits will not be recognized. This design decision was made deliberately, with full knowledge of that limitation.

-

222. Are throw clauses necessary if a throw is already implied by the effects clause?

Section: 17.3.1.3 [lib.structure.specifications]  Status: TC  Submitter: Judy Ward  Date: 17 Mar 2000

+

222. Are throw clauses necessary if a throw is already implied by the effects clause?

Section: 17.3.1.3 [lib.structure.specifications]  Status: TC  Submitter: Judy Ward  Date: 17 Mar 2000

Section 21.3.6.8 describes the basic_string::compare function this way:

21.3.6.8 - basic_string::compare [lib.string::compare]
@@ -6025,7 +6027,7 @@ int compare(size_type pos1, size_type n1,

and the constructor that's implicitly called by the above is defined to throw an out-of-range exception if pos > str.size(). See -section 21.3.1 [lib.string.cons] paragraph 4.

+section 21.3.1 [lib.string.cons] paragraph 4.

On the other hand, the compare function descriptions themselves don't have "Throws: " clauses and according to 17.3.1.3, paragraph 3, elements @@ -6034,7 +6036,7 @@ that do not apply to a function are omitted.

"Effects" clauses correct, or are the "Throws" clauses missing?

Proposed resolution:

-

In 17.3.1.3 [lib.structure.specifications] paragraph 3, the footnote 148 attached to +

In 17.3.1.3 [lib.structure.specifications] paragraph 3, the footnote 148 attached to the sentence "Descriptions of function semantics contain the following elements (as appropriate):", insert the word "further" so that the foot note reads:

@@ -6050,10 +6052,10 @@ throw. The inconsistent wording is in a footnote, and thus non-normative. The proposed resolution from the LWG clarifies the footnote.

-

223. reverse algorithm should use iter_swap rather than swap

Section: 25.2.9 [lib.alg.reverse]  Status: TC  Submitter: Dave Abrahams  Date: 21 Mar 2000

+

223. reverse algorithm should use iter_swap rather than swap

Section: 25.2.9 [lib.alg.reverse]  Status: TC  Submitter: Dave Abrahams  Date: 21 Mar 2000

Shouldn't the effects say "applies iter_swap to all pairs..."?

Proposed resolution:

-

In 25.2.9 [lib.alg.reverse], replace:

+

In 25.2.9 [lib.alg.reverse], replace:

Effects: For each non-negative integer i <= (last - first)/2, applies swap to all pairs of iterators first + i, (last - i) - 1. @@ -6064,7 +6066,7 @@ footnote.

applies iter_swap to all pairs of iterators first + i, (last - i) - 1.
-

224. clear() complexity for associative containers refers to undefined N

Section: 23.1.2 [lib.associative.reqmts]  Status: TC  Submitter: Ed Brey  Date: 23 Mar 2000

+

224. clear() complexity for associative containers refers to undefined N

Section: 23.1.2 [lib.associative.reqmts]  Status: TC  Submitter: Ed Brey  Date: 23 Mar 2000

In the associative container requirements table in 23.1.2 paragraph 7, a.clear() has complexity "log(size()) + N". However, the meaning of N is not defined.

@@ -6078,7 +6080,7 @@ error: there's no difference between O(N) and O(N + log(N)). The text in the standard is probably an incorrect cut-and-paste from the range version of erase.

-

225. std:: algorithms use of other unqualified algorithms

Section: 17.4.4.3 [lib.global.functions]  Status: WP  Submitter: Dave Abrahams  Date: 01 Apr 2000

+

225. std:: algorithms use of other unqualified algorithms

Section: 17.4.4.3 [lib.global.functions]  Status: WP  Submitter: Dave Abrahams  Date: 01 Apr 2000

Are algorithms in std:: allowed to use other algorithms without qualification, so functions in user namespaces might be found through Koenig lookup?

For example, a popular standard library implementation includes this @@ -6139,12 +6141,12 @@ leading "::" qualification is not required because any namespace qualification is sufficient to suppress Koenig lookup.]

Proposed resolution:

Add a paragraph and a note at the end of -17.4.4.3 [lib.global.functions]:

+17.4.4.3 [lib.global.functions]:

Unless otherwise specified, no global or non-member function in the standard library shall use a function from another namespace which is -found through argument-dependent name lookup (3.4.2 [basic.lookup.koenig]).

+found through argument-dependent name lookup (3.4.2 [basic.lookup.koenig]).

[Note: the phrase "unless otherwise specified" is intended to allow Koenig lookup in cases like that of ostream_iterators:
@@ -6163,9 +6165,9 @@ allow Koenig lookup in cases like that of ostream_iterators:
is as yet unsure if the proposed resolution is the best solution. Furthermore, the LWG believes that the same problem of unqualified library names applies to wording in the standard itself, -and has opened issue 229 accordingly. Any resolution of -issue 225 should be coordinated with the resolution of -issue 229.]

+and has opened issue 229 accordingly. Any resolution of +issue 225 should be coordinated with the resolution of +issue 229.]

[Toronto: The LWG is not sure if this is a defect in the standard. Most LWG members believe that an implementation of @@ -6190,10 +6192,10 @@ resolution for this issue is in accordance with Howard's paper.]

other namespace. However, this is at worst a clarification. It is surely right that algorithsm shouldn't pick up random names, that user-defined names should have no effect unless otherwise specified. - Issue 226 deals with the question of when it is + Issue 226 deals with the question of when it is appropriate for the standard to explicitly specify otherwise.

-

226. User supplied specializations or overloads of namespace std function templates

Section: 17.4.3.1 [lib.reserved.names]  Status: WP  Submitter: Dave Abrahams  Date: 01 Apr 2000

+

226. User supplied specializations or overloads of namespace std function templates

Section: 17.4.3.1 [lib.reserved.names]  Status: WP  Submitter: Dave Abrahams  Date: 01 Apr 2000

The issues are: 

1. How can a 3rd party library implementor (lib1) write a version of a standard algorithm which is specialized to work with his own class template? 

@@ -6236,7 +6238,7 @@ eventually be used with lib2. This may seem innocuous at first when applied to names like swap, but consider more ambiguous names like unique_copy() instead. It is easy to imagine the user wanting to define these names differently in his own namespace. A definition with semantics incompatible with the standard -library could cause serious problems (see issue 225).

+library could cause serious problems (see issue 225).

Why, you may ask, can't we just partially specialize std::swap()? It's because the language doesn't allow for partial specialization of function templates. If you write:

@@ -6359,10 +6361,10 @@ resolution is the one proposed by Howard.]

(such as iter_swap, swap_ranges, reverse, rotate, and sort) conform to that concept. The Swappable concept will make it clear that these algorithms use unqualified lookup for the calls - to swap. Also, in 26.3.3.3 [lib.valarray.transcend] paragraph 1, + to swap. Also, in 26.3.3.3 [lib.valarray.transcend] paragraph 1, state that the valarray transcendentals use unqualified lookup.

-

227. std::swap() should require CopyConstructible or DefaultConstructible arguments

Section: 25.2.2 [lib.alg.swap]  Status: TC  Submitter: Dave Abrahams  Date: 09 Apr 2000

+

227. std::swap() should require CopyConstructible or DefaultConstructible arguments

Section: 25.2.2 [lib.alg.swap]  Status: TC  Submitter: Dave Abrahams  Date: 09 Apr 2000

25.2.2 reads:

template<class T> void swap(T& a, T& b);
@@ -6403,9 +6405,9 @@ resolution is the one proposed by Howard.]

Requires: Type T is CopyConstructible (20.1.3) and Assignable (23.1)

-

228. Incorrect specification of "..._byname" facets

Section: 22.2 [lib.locale.categories]  Status: WP  Submitter: Dietmar Kühl  Date: 20 Apr 2000

-

The sections 22.2.1.2 [lib.locale.ctype.byname], 22.2.1.4 [lib.locale.ctype.byname.special], -22.2.1.6 [lib.locale.codecvt.byname], 22.2.3.2 [lib.locale.numpunct.byname], 22.2.4.2 [lib.locale.collate.byname], 22.2.5.4 [lib.locale.time.put.byname], 22.2.6.4 [lib.locale.moneypunct.byname], and 22.2.7.2 [lib.locale.messages.byname] overspecify the +

228. Incorrect specification of "..._byname" facets

Section: 22.2 [lib.locale.categories]  Status: WP  Submitter: Dietmar Kühl  Date: 20 Apr 2000

+

The sections 22.2.1.2 [lib.locale.ctype.byname], 22.2.1.4 [lib.locale.ctype.byname.special], +22.2.1.6 [lib.locale.codecvt.byname], 22.2.3.2 [lib.locale.numpunct.byname], 22.2.4.2 [lib.locale.collate.byname], 22.2.5.4 [lib.locale.time.put.byname], 22.2.6.4 [lib.locale.moneypunct.byname], and 22.2.7.2 [lib.locale.messages.byname] overspecify the definitions of the "..._byname" classes by listing a bunch of virtual functions. At the same time, no semantics of these functions are defined. Real implementations do not define these @@ -6524,18 +6526,18 @@ specialization it is not virtual.

~messages_byname(); // virtual }; } -

Remove section 22.2.1.4 [lib.locale.ctype.byname.special] completely (because in +

Remove section 22.2.1.4 [lib.locale.ctype.byname.special] completely (because in this case only those members are defined to be virtual which are defined to be virtual in 'ctype<cT>'.)

[Post-Tokyo: Dietmar Kühl submitted this issue at the request of -the LWG to solve the underlying problems raised by issue 138.]

+the LWG to solve the underlying problems raised by issue 138.]

[Copenhagen: proposed resolution was revised slightly, to remove three last virtual functions from messages_byname.]

-

229. Unqualified references of other library entities

Section: 17.4.1.1 [lib.contents]  Status: WP  Submitter: Steve Clamage  Date: 19 Apr 2000

+

229. Unqualified references of other library entities

Section: 17.4.1.1 [lib.contents]  Status: WP  Submitter: Steve Clamage  Date: 19 Apr 2000

Throughout the library chapters, the descriptions of library entities refer to other library entities without necessarily qualifying the names.

@@ -6549,7 +6551,7 @@ override any ::std::swap function when Koenig lookup applies.

"::std::" throughout, too many lines in the standard would have to be adjusted to make that change in a Technical Corrigendum.

-

Issue 182, which addresses qualification of +

Issue 182, which addresses qualification of size_t, is a special case of this.

Proposed resolution:

@@ -6563,7 +6565,7 @@ adjusted to make that change in a Technical Corrigendum.

[Post-Tokyo: Steve Clamage submitted this issue at the request of the LWG to solve a problem in the standard itself similar to the -problem within implementations of library identified by issue 225. Any resolution of issue 225 should be +problem within implementations of library identified by issue 225. Any resolution of issue 225 should be coordinated with the resolution of this issue.]

[post-Toronto: Howard is undecided about whether it is @@ -6586,8 +6588,8 @@ issues 225 and 226. In light of that resolution, the proposed resolution for the current issue makes sense.]

-

230. Assignable specified without also specifying CopyConstructible

Section: 17 [lib.library]  Status: WP  Submitter: Beman Dawes  Date: 26 Apr 2000

-

Issue 227 identified an instance (std::swap) where +

230. Assignable specified without also specifying CopyConstructible

Section: 17 [lib.library]  Status: WP  Submitter: Beman Dawes  Date: 26 Apr 2000

+

Issue 227 identified an instance (std::swap) where Assignable was specified without also specifying CopyConstructible. The LWG asked that the standard be searched to determine if the same defect existed elsewhere.

@@ -6595,19 +6597,19 @@ determine if the same defect existed elsewhere.

There are a number of places (see proposed resolution below) where Assignable is specified without also specifying CopyConstructible. There are also several cases where both are -specified. For example, 26.4.1 [lib.accumulate].

+specified. For example, 26.4.1 [lib.accumulate].

Proposed resolution:

-

In 23.1 [lib.container.requirements] table 65 for value_type: +

In 23.1 [lib.container.requirements] table 65 for value_type: change "T is Assignable" to "T is CopyConstructible and Assignable"

-

In 23.1.2 [lib.associative.reqmts] table 69 X::key_type; change +

In 23.1.2 [lib.associative.reqmts] table 69 X::key_type; change "Key is Assignable" to "Key is CopyConstructible and Assignable"

-

In 24.1.2 [lib.output.iterators] paragraph 1, change: +

In 24.1.2 [lib.output.iterators] paragraph 1, change:

A class or a built-in type X satisfies the requirements of an @@ -6626,12 +6628,12 @@ Table 73:

[Post-Tokyo: Beman Dawes submitted this issue at the request of -the LWG. He asks that the 25.2.4 [lib.alg.replace] and 25.2.5 [lib.alg.fill] changes be studied carefully, as it is not clear that +the LWG. He asks that the 25.2.4 [lib.alg.replace] and 25.2.5 [lib.alg.fill] changes be studied carefully, as it is not clear that CopyConstructible is really a requirement and may be overspecification.]

[Portions of the resolution for issue 230 have been superceded by -the resolution of issue 276.]

+the resolution of issue 276.]

Rationale:

The original proposed resolution also included changes to input @@ -6641,7 +6643,7 @@ Assignable type was also required to be Copy Constructible, but decided against this because fill and replace really don't require the Copy Constructible property.

-

231. Precision in iostream?

Section: 22.2.2.2.2 [lib.facet.num.put.virtuals]  Status: WP  Submitter: James Kanze, Stephen Clamage  Date:  25 Apr 2000

+

231. Precision in iostream?

Section: 22.2.2.2.2 [lib.facet.num.put.virtuals]  Status: WP  Submitter: James Kanze, Stephen Clamage  Date:  25 Apr 2000

What is the following program supposed to output?

#include <iostream>
 
@@ -6682,7 +6684,7 @@ etc. Plus, of course, if precision == 0 and flags & floatfield ==
 of the anomalies of printf:-).

 
Proposed resolution:

 

-Replace 22.2.2.2.2  [lib.facet.num.put.virtuals], paragraph 11, with the following 
+Replace 22.2.2.2.2  [lib.facet.num.put.virtuals], paragraph 11, with the following 
 sentence:
 

 

@@ -6709,7 +6711,7 @@ case.

 where precision is 0 and mode is %g.]

 
 

-
232. "depends" poorly defined in 17.4.3.1
Section: 17.4.3.1  [lib.reserved.names]  Status: WP  Submitter: Peter Dimov  Date: 18 Apr 2000

+
232. "depends" poorly defined in 17.4.3.1
Section: 17.4.3.1  [lib.reserved.names]  Status: WP  Submitter: Peter Dimov  Date: 18 Apr 2000

 
17.4.3.1/1 uses the term "depends" to limit the set of allowed
 specializations of standard templates to those that "depend on a
 user-defined name of external linkage."

@@ -6741,24 +6743,24 @@ possible way for a user to come up with a specialization for bitset,
 for example, that might not have already been specialized by the
 implementor?

 
-
[Toronto: this may be related to issue 120.]

+
[Toronto: this may be related to issue 120.]

 
 
[post-Toronto: Judy provided the above proposed resolution and
 rationale.]

 

-
234. Typos in allocator definition
Section: 20.4.1.1  [lib.allocator.members]  Status: WP  Submitter: Dietmar Kühl  Date: 24 Apr 2000

+
234. Typos in allocator definition
Section: 20.4.1.1  [lib.allocator.members]  Status: WP  Submitter: Dietmar Kühl  Date: 24 Apr 2000

 
In paragraphs 12 and 13 the effects of construct() and
 destruct() are described as returns but the functions actually
 return void.

 
Proposed resolution:

 
Substitute "Returns" by "Effect".

 

-
235. No specification of default ctor for reverse_iterator
Section: 24.4.1.1  [lib.reverse.iterator]  Status: WP  Submitter: Dietmar Kühl  Date: 24 Apr 2000

+
235. No specification of default ctor for reverse_iterator
Section: 24.4.1.1  [lib.reverse.iterator]  Status: WP  Submitter: Dietmar Kühl  Date: 24 Apr 2000

 
The declaration of reverse_iterator lists a default
 constructor.  However, no specification is given what this constructor
 should do.

 
Proposed resolution:

-  
In section 24.4.1.3.1  [lib.reverse.iter.cons] add the following
+  
In section 24.4.1.3.1  [lib.reverse.iter.cons] add the following
   paragraph:

       

       
reverse_iterator()

@@ -6771,7 +6773,7 @@ should do.

   
[pre-Copenhagen: Dietmar provide wording for proposed
   resolution.]

 

-
237. Undefined expression in complexity specification
Section: 23.2.2.1  [lib.list.cons]  Status: WP  Submitter: Dietmar Kühl  Date: 24 Apr 2000

+
237. Undefined expression in complexity specification
Section: 23.2.2.1  [lib.list.cons]  Status: WP  Submitter: Dietmar Kühl  Date: 24 Apr 2000

 
The complexity specification in paragraph 6 says that the complexity
 is linear in first - last. Even if operator-() is
 defined on iterators this term is in general undefined because it
@@ -6782,7 +6784,7 @@ would have to be last - first.

   
to become

      
Linear in distance(first, last).

 

-
238. Contradictory results of stringbuf initialization.
Section: 27.7.1.1  [lib.stringbuf.cons]  Status: WP  Submitter: Dietmar Kühl  Date: 11 May 2000

+
238. Contradictory results of stringbuf initialization.
Section: 27.7.1.1  [lib.stringbuf.cons]  Status: WP  Submitter: Dietmar Kühl  Date: 11 May 2000

 
In 27.7.1.1 paragraph 4 the results of calling the constructor of
 'basic_stringbuf' are said to be str() == str. This is fine
 that far but consider this code:

@@ -6807,7 +6809,7 @@ defined to be basic_string<cT>().

 we fixed it, it would say just the same thing as text that's already
 in the standard.

 

-
239. Complexity of unique() and/or unique_copy incorrect
Section: 25.2.8  [lib.alg.unique]  Status: WP  Submitter: Angelika Langer  Date: May 15 2000

+
239. Complexity of unique() and/or unique_copy incorrect
Section: 25.2.8  [lib.alg.unique]  Status: WP  Submitter: Angelika Langer  Date: May 15 2000

 
The complexity of unique and unique_copy are inconsistent with each
 other and inconsistent with the implementations.  The standard
 specifies:

@@ -6834,13 +6836,13 @@ applying the predicate last-first times, especially since it is not
 specified to which pair in the sequence the predicate is applied
 twice.

 
Proposed resolution:

-
Change both complexity sections in 25.2.8  [lib.alg.unique] to:

+
Change both complexity sections in 25.2.8  [lib.alg.unique] to:

 
 
Complexity: For nonempty ranges, exactly last - first - 1
 applications of the corresponding predicate.

 
 

-
240. Complexity of adjacent_find() is meaningless
Section: 25.1.5  [lib.alg.adjacent.find]  Status: WP  Submitter: Angelika Langer  Date: May 15 2000

+
240. Complexity of adjacent_find() is meaningless
Section: 25.1.5  [lib.alg.adjacent.find]  Status: WP  Submitter: Angelika Langer  Date: May 15 2000

 
The complexity section of adjacent_find is defective:

 
 

@@ -6875,7 +6877,7 @@ not required of predicates because they can have non-const data
 members. For this reason, a specification using a binder could only be
 an "as-if" specification.

 
Proposed resolution:

-
Change the complexity section in 25.1.5  [lib.alg.adjacent.find] to:

+
Change the complexity section in 25.1.5  [lib.alg.adjacent.find] to:

 

 For a nonempty range, exactly min((i - first) + 1,
 (last - first) - 1) applications of the
@@ -6887,7 +6889,7 @@ return value.
 bound.  The LWG preferred an exact count.]

 
 

-
241. Does unique_copy() require CopyConstructible and Assignable?
Section: 25.2.8  [lib.alg.unique]  Status: WP  Submitter: Angelika Langer  Date: May 15 2000

+
241. Does unique_copy() require CopyConstructible and Assignable?
Section: 25.2.8  [lib.alg.unique]  Status: WP  Submitter: Angelika Langer  Date: May 15 2000

 
 
Some popular implementations of unique_copy() create temporary
 copies of values in the input sequence, at least if the input iterator
@@ -6898,7 +6900,7 @@ the value type is CopyConstructible and Assignable.

 specify any additional requirements that they impose on any of the
 types used by the algorithm. An example of an algorithm that creates
 temporary copies and correctly specifies the additional requirements
-is accumulate(), 26.4.1  [lib.accumulate].

+is accumulate(), 26.4.1  [lib.accumulate].

 
 
Since the specifications of unique() and unique_copy() do not
 require CopyConstructible and Assignable of the InputIterator's value
@@ -6941,12 +6943,12 @@ minor as not to require re-review.
 ]

 
 

-
242. Side effects of function objects
Section: 25.2.3  [lib.alg.transform], 26.4  [lib.numeric.ops]  Status: WP  Submitter: Angelika Langer  Date: May 15 2000

+
242. Side effects of function objects
Section: 25.2.3  [lib.alg.transform], 26.4  [lib.numeric.ops]  Status: WP  Submitter: Angelika Langer  Date: May 15 2000

 
The algorithms transform(), accumulate(), inner_product(),
 partial_sum(), and adjacent_difference() require that the function
 object supplied to them shall not have any side effects.

 
-
The standard defines a side effect in 1.9  [intro.execution] as:

+
The standard defines a side effect in 1.9  [intro.execution] as:

 
-7- Accessing an object designated by a volatile lvalue (basic.lval),
 modifying an object, calling a library I/O function, or calling a function
 that does any of those operations are all side effects, which are changes
@@ -7119,7 +7121,7 @@ added footnotes pointing out that the use of closed ranges was
 intentional.]

 
 

-
243. get and getline when sentry reports failure
Section: 27.6.1.3  [lib.istream.unformatted]  Status: WP  Submitter: Martin Sebor  Date: May 15 2000

+
243. get and getline when sentry reports failure
Section: 27.6.1.3  [lib.istream.unformatted]  Status: WP  Submitter: Martin Sebor  Date: May 15 2000

 
basic_istream<>::get(), and basic_istream<>::getline(),
 are unclear with respect to the behavior and side-effects of the named
 functions in case of an error.

@@ -7166,7 +7168,7 @@ had language that made this an unambiguous requirement; those words
 were moved to a place where their context made them less clear.  See
 Jerry Schwarz's message c++std-lib-7618.

 

-
248. time_get fails to set eofbit
Section: 22.2.5  [lib.category.time]  Status: WP  Submitter: Martin Sebor  Date: 22 June 2000

+
248. time_get fails to set eofbit
Section: 22.2.5  [lib.category.time]  Status: WP  Submitter: Martin Sebor  Date: 22 June 2000

 
There is no requirement that any of time_get member functions set
 ios::eofbit when they reach the end iterator while parsing their input.
 Since members of both the num_get and money_get facets are required to
@@ -7184,7 +7186,7 @@ member functions, the member sets ios_base::eofbit in err.
 because it was more consistent with the way eof is described for other
 input facets.

 

-
250. splicing invalidates iterators
Section: 23.2.2.4  [lib.list.ops]  Status: WP  Submitter: Brian Parker   Date: 14 Jul 2000

+
250. splicing invalidates iterators
Section: 23.2.2.4  [lib.list.ops]  Status: WP  Submitter: Brian Parker   Date: 14 Jul 2000

 

 Section 23.2.2.4 [lib.list.ops] states that
 

@@ -7201,14 +7203,14 @@ after splice.
 

 
Proposed resolution:

 
-
Add a footnote to 23.2.2.4  [lib.list.ops], paragraph 1:

+
Add a footnote to 23.2.2.4  [lib.list.ops], paragraph 1:

 

-[Footnote: As specified in 20.1.5  [lib.allocator.requirements], paragraphs
+[Footnote: As specified in 20.1.5  [lib.allocator.requirements], paragraphs
 4-5, the semantics described in this clause applies only to the case
 where allocators compare equal.  --end footnote]
 

 
-
In 23.2.2.4  [lib.list.ops], replace paragraph 4 with:

+
In 23.2.2.4  [lib.list.ops], replace paragraph 4 with:

 

 Effects: Inserts the contents of x before position and x becomes 
 empty.  Pointers and references to the moved elements of x now refer to 
@@ -7217,7 +7219,7 @@ moved elements will continue to refer to their elements, but they now
 behave as iterators into *this, not into x.
 

 
-
In 23.2.2.4  [lib.list.ops], replace paragraph 7 with:

+
In 23.2.2.4  [lib.list.ops], replace paragraph 7 with:

 

 Effects: Inserts an element pointed to by i from list x before 
 position and removes the element from x. The result is unchanged if 
@@ -7227,7 +7229,7 @@ to refer to this same element but as a member of *this.  Iterators to *i
 behave as iterators into *this, not into x.
 

 
-
In 23.2.2.4  [lib.list.ops], replace paragraph 12 with:

+
In 23.2.2.4  [lib.list.ops], replace paragraph 12 with:

 

 Requires: [first, last) is a valid range in x. The result is 
 undefined if position is an iterator in the range [first, last).  
@@ -7242,10 +7244,10 @@ iterators into *this, not into x.
 
The original proposed resolution said that iterators and references
 would remain "valid".  The new proposed resolution clarifies what that
 means.  Note that this only applies to the case of equal allocators.
->From 20.1.5  [lib.allocator.requirements] paragraph 4, the behavior of list when
+From 20.1.5  [lib.allocator.requirements] paragraph 4, the behavior of list when
 allocators compare nonequal is outside the scope of the standard.

 

-
251. basic_stringbuf missing allocator_type
Section: 27.7.1  [lib.stringbuf]  Status: WP  Submitter: Martin Sebor  Date: 28 Jul 2000

+
251. basic_stringbuf missing allocator_type
Section: 27.7.1  [lib.stringbuf]  Status: WP  Submitter: Martin Sebor  Date: 28 Jul 2000

 
The synopsis for the template class basic_stringbuf
 doesn't list a typedef for the template parameter
 Allocator. This makes it impossible to determine the type of
@@ -7259,7 +7261,7 @@ basic_stringstream (27.7.4) the typedef:

 
  typedef Allocator allocator_type;
 

 

-
252. missing casts/C-style casts used in iostreams
Section: 27.7  [lib.string.streams]  Status: WP  Submitter: Martin Sebor  Date: 28 Jul 2000

+
252. missing casts/C-style casts used in iostreams
Section: 27.7  [lib.string.streams]  Status: WP  Submitter: Martin Sebor  Date: 28 Jul 2000

 
27.7.2.2, p1 uses a C-style cast rather than the more appropriate
 const_cast<> in the Returns clause for basic_istringstream<>::rdbuf().
 The same C-style cast is being used in 27.7.3.2, p1, D.7.2.2, p1, and
@@ -7294,7 +7296,7 @@ issue is stylistic rather than a matter of correctness.

 
with

 
  -2- Returns: const_cast<strstreambuf*>(&sb).

 

-
253. valarray helper functions are almost entirely useless
Section: 26.3.2.1  [lib.valarray.cons], 26.3.2.2  [lib.valarray.assign]  Status: WP  Submitter: Robert Klarer  Date: 31 Jul 2000

+
253. valarray helper functions are almost entirely useless
Section: 26.3.2.1  [lib.valarray.cons], 26.3.2.2  [lib.valarray.assign]  Status: WP  Submitter: Robert Klarer  Date: 31 Jul 2000

 
This discussion is adapted from message c++std-lib-7056 posted
 November 11, 1999.  I don't think that anyone can reasonably claim
 that the problem described below is NAD.

@@ -7369,66 +7371,66 @@ classes are almost entirely useless.

 
slice_array:

 
 
 
gslice_array:

 
 
 
mask_array:

 
 
 
indirect_array:

 
 
[Proposed resolution was modified in Santa Cruz: explicitly make
 copy constructor and copy assignment operators public, instead of
@@ -7445,7 +7447,7 @@ believed we should make the assignment operators public, in addition
 to the copy constructors, for reasons of symmetry and user
 expectation.

 

-
256. typo in 27.4.4.2, p17: copy_event does not exist
Section: 27.4.4.2  [lib.basic.ios.members]  Status: WP  Submitter: Martin Sebor  Date: 21 Aug 2000

+
256. typo in 27.4.4.2, p17: copy_event does not exist
Section: 27.4.4.2  [lib.basic.ios.members]  Status: WP  Submitter: Martin Sebor  Date: 21 Aug 2000

 

 27.4.4.2, p17 says
 

@@ -7464,7 +7466,7 @@ copyfmt_event.
 
Proposed resolution:

 
Replace copy_event with copyfmt_event in the named paragraph.

 

-
259. basic_string::operator[] and const correctness
Section: 21.3.4  [lib.string.access]  Status: WP  Submitter: Chris Newton   Date: 27 Aug 2000

+
259. basic_string::operator[] and const correctness
Section: 21.3.4  [lib.string.access]  Status: WP  Submitter: Chris Newton   Date: 27 Aug 2000

 

 Paraphrased from a message that Chris Newton posted to comp.std.c++:
 

@@ -7488,7 +7490,7 @@ In section 21.3.4, paragraph 1, change
 

 

 
260. Inconsistent return type of istream_iterator::operator++(int)
-
Section: 24.5.1.2  [lib.istream.iterator.ops]  Status: WP  Submitter: Martin Sebor  Date: 27 Aug 2000

+
Section: 24.5.1.2  [lib.istream.iterator.ops]  Status: WP  Submitter: Martin Sebor  Date: 27 Aug 2000

 
The synopsis of istream_iterator::operator++(int) in 24.5.1 shows
 it as returning the iterator by value. 24.5.1.2, p5 shows the same
 operator as returning the iterator by reference. That's incorrect
@@ -7504,7 +7506,7 @@ given the Effects clause below (since a temporary is returned). The
 
(that is, remove the `&').

 

 
261. Missing description of istream_iterator::operator!=
-
Section: 24.5.1.2  [lib.istream.iterator.ops]  Status: WP  Submitter: Martin Sebor  Date: 27 Aug 2000

+
Section: 24.5.1.2  [lib.istream.iterator.ops]  Status: WP  Submitter: Martin Sebor  Date: 27 Aug 2000

 

 24.5.1, p3 lists the synopsis for
 

@@ -7530,7 +7532,7 @@ Add paragraph 7 to the end of section 24.5.1.2 with the following text:
 
 
-7- Returns: !(x == y).

 

-
262. Bitmask operator ~ specified incorrectly
Section: 17.3.2.1.2  [lib.bitmask.types]  Status: WP  Submitter: Beman Dawes  Date: 03 Sep 2000

+
262. Bitmask operator ~ specified incorrectly
Section: 17.3.2.1.2  [lib.bitmask.types]  Status: WP  Submitter: Beman Dawes  Date: 03 Sep 2000

 

 The ~ operation should be applied after the cast to int_type.
 

@@ -7551,7 +7553,7 @@ to:
      { return static_cast< bitmask>(~static_cast<int_type>(X)); }
-

263. Severe restriction on basic_string reference counting

Section: 21.3 [lib.basic.string]  Status: WP  Submitter: Kevlin Henney  Date: 04 Sep 2000

+

263. Severe restriction on basic_string reference counting

Section: 21.3 [lib.basic.string]  Status: WP  Submitter: Kevlin Henney  Date: 04 Sep 2000

The note in paragraph 6 suggests that the invalidation rules for references, pointers, and iterators in paragraph 5 permit a reference- @@ -7621,14 +7623,14 @@ Change the following sentence in 21.3 paragraph 5 from or rend().

-

264. Associative container insert(i, j) complexity requirements are not feasible.

Section: 23.1.2 [lib.associative.reqmts]  Status: WP  Submitter: John Potter  Date: 07 Sep 2000

+

264. Associative container insert(i, j) complexity requirements are not feasible.

Section: 23.1.2 [lib.associative.reqmts]  Status: WP  Submitter: John Potter  Date: 07 Sep 2000

Table 69 requires linear time if [i, j) is sorted. Sorted is necessary but not sufficient. Consider inserting a sorted range of even integers into a set<int> containing the odd integers in the same range.

-

Related issue: 102

+

Related issue: 102

Proposed resolution:

In Table 69, in section 23.1.2, change the complexity clause for @@ -7660,7 +7662,7 @@ inserted is sorted, it's more trouble than it's worth to say that it's linear in some special cases.

-

265. std::pair::pair() effects overly restrictive

Section: 20.2.2 [lib.pairs]  Status: WP  Submitter: Martin Sebor  Date: 11 Sep 2000

+

265. std::pair::pair() effects overly restrictive

Section: 20.2.2 [lib.pairs]  Status: WP  Submitter: Martin Sebor  Date: 11 Sep 2000

I don't see any requirements on the types of the elements of the std::pair container in 20.2.2. From the descriptions of the member @@ -7697,7 +7699,7 @@ default constructor was written the obvious way. This has been clarified by core issue 178, and there is no longer any doubt that the straightforward implementation is correct.

-

266. bad_exception::~bad_exception() missing Effects clause

Section: 18.6.2.1 [lib.bad.exception]  Status: WP  Submitter: Martin Sebor  Date: 24 Sep 2000

+

266. bad_exception::~bad_exception() missing Effects clause

Section: 18.6.2.1 [lib.bad.exception]  Status: WP  Submitter: Martin Sebor  Date: 24 Sep 2000

The synopsis for std::bad_exception lists the function ~bad_exception() but there is no description of what the function does (the Effects @@ -7706,10 +7708,10 @@ clause is missing).

Proposed resolution:

Remove the destructor from the class synopses of -bad_alloc (18.4.2.1 [lib.bad.alloc]), -bad_cast (18.5.2 [lib.bad.cast]), -bad_typeid (18.5.3 [lib.bad.typeid]), -and bad_exception (18.6.2.1 [lib.bad.exception]). +bad_alloc (18.4.2.1 [lib.bad.alloc]), +bad_cast (18.5.2 [lib.bad.cast]), +bad_typeid (18.5.3 [lib.bad.typeid]), +and bad_exception (18.6.2.1 [lib.bad.exception]).

Rationale:

@@ -7720,7 +7722,7 @@ removing them is more consistent with how exception classes are described in clause 19.

-

268. Typo in locale synopsis

Section: 22.1.1 [lib.locale]  Status: WP  Submitter: Martin Sebor  Date: 5 Oct 2000

+

268. Typo in locale synopsis

Section: 22.1.1 [lib.locale]  Status: WP  Submitter: Martin Sebor  Date: 5 Oct 2000

The synopsis of the class std::locale in 22.1.1 contains two typos: the semicolons after the declarations of the default ctor locale::locale() and the copy ctor locale::locale(const locale&) @@ -7740,7 +7742,7 @@ are missing.

locale(const locale& other) throw();
-

270. Binary search requirements overly strict

Section: 25.3.3 [lib.alg.binary.search]  Status: WP  Submitter: Matt Austern  Date: 18 Oct 2000

+

270. Binary search requirements overly strict

Section: 25.3.3 [lib.alg.binary.search]  Status: WP  Submitter: Matt Austern  Date: 18 Oct 2000

Each of the four binary search algorithms (lower_bound, upper_bound, equal_range, binary_search) has a form that allows the user to pass a @@ -7990,7 +7992,7 @@ that the upper bound is no earlier than the lower bound, that the pair returned by equal_range is a valid range, and that the first part of that pair is the lower bound.

-

271. basic_iostream missing typedefs

Section: 27.6.1.5 [lib.iostreamclass]  Status: WP  Submitter: Martin Sebor  Date: 02 Nov 2000

+

271. basic_iostream missing typedefs

Section: 27.6.1.5 [lib.iostreamclass]  Status: WP  Submitter: Martin Sebor  Date: 02 Nov 2000

Class template basic_iostream has no typedefs. The typedefs it inherits from its base classes can't be used, since (for example) @@ -7999,7 +8001,7 @@ basic_iostream<T>::traits_type is ambiguous.

Proposed resolution:

Add the following to basic_iostream's class synopsis in -27.6.1.5 [lib.iostreamclass], immediately after public:

+27.6.1.5 [lib.iostreamclass], immediately after public:

  // types:
   typedef charT                     char_type;
@@ -8009,7 +8011,7 @@ basic_iostream<T>::traits_type is ambiguous.
   typedef traits                    traits_type;
-

272. Missing parentheses around subexpression

Section: 27.4.4.3 [lib.iostate.flags]  Status: WP  Submitter: Martin Sebor  Date: 02 Nov 2000

+

272. Missing parentheses around subexpression

Section: 27.4.4.3 [lib.iostate.flags]  Status: WP  Submitter: Martin Sebor  Date: 02 Nov 2000

27.4.4.3, p4 says about the postcondition of the function: If rdbuf()!=0 then state == rdstate(); otherwise @@ -8026,7 +8028,7 @@ anything but non-zero. Add parentheses like so: rdstate()==(state|ios_base::badbit).

-

273. Missing ios_base qualification on members of a dependent class

Section: 27 [lib.input.output]  Status: WP  Submitter: Martin Sebor  Date: 02 Nov 2000

+

273. Missing ios_base qualification on members of a dependent class

Section: 27 [lib.input.output]  Status: WP  Submitter: Martin Sebor  Date: 02 Nov 2000

27.5.2.4.2, p4, and 27.8.1.6, p2, 27.8.1.7, p3, 27.8.1.9, p2, 27.8.1.10, p3 refer to in and/or out w/o ios_base:: qualification. That's incorrect since the names are members of a dependent base @@ -8035,7 +8037,7 @@ class (14.6.2 [temp.dep]) and thus not visible.

Qualify the names with the name of the class of which they are members, i.e., ios_base.

-

274. a missing/impossible allocator requirement

Section: 20.1.5 [lib.allocator.requirements]  Status: WP  Submitter: Martin Sebor  Date: 02 Nov 2000

+

274. a missing/impossible allocator requirement

Section: 20.1.5 [lib.allocator.requirements]  Status: WP  Submitter: Martin Sebor  Date: 02 Nov 2000

I see that table 31 in 20.1.5, p3 allows T in std::allocator<T> to be of any type. But the synopsis in 20.4.1 calls for allocator<>::address() to @@ -8090,7 +8092,7 @@ also forbids volatile types and reference types. excluded from the PR.]

-

275. Wrong type in num_get::get() overloads

Section: 22.2.2.1.1 [lib.facet.num.get.members]  Status: WP  Submitter: Matt Austern  Date: 02 Nov 2000

+

275. Wrong type in num_get::get() overloads

Section: 22.2.2.1.1 [lib.facet.num.get.members]  Status: WP  Submitter: Matt Austern  Date: 02 Nov 2000

In 22.2.2.1.1, we have a list of overloads for num_get<>::get(). There are eight overloads, all of which are identical except for the @@ -8129,7 +8131,7 @@ These two lists are not identical. They should be, since the arguments it was given.

Proposed resolution:

-

In 22.2.2.1.1 [lib.facet.num.get.members], change

+

In 22.2.2.1.1 [lib.facet.num.get.members], change

  iter_type get(iter_type in, iter_type end, ios_base& str,
                 ios_base::iostate& err, short& val) const;
@@ -8138,10 +8140,10 @@ the arguments it was given. ios_base::iostate& err, float& val) const;
-

276. Assignable requirement for container value type overly strict

Section: 23.1 [lib.container.requirements]  Status: WP  Submitter: Peter Dimov  Date: 07 Nov 2000

+

276. Assignable requirement for container value type overly strict

Section: 23.1 [lib.container.requirements]  Status: WP  Submitter: Peter Dimov  Date: 07 Nov 2000

23.1/3 states that the objects stored in a container must be -Assignable. 23.3.1 [lib.map], paragraph 2, +Assignable. 23.3.1 [lib.map], paragraph 2, states that map satisfies all requirements for a container, while in the same time defining value_type as pair<const Key, T> - a type that is not Assignable. @@ -8165,14 +8167,14 @@ general.

For example, the proposed resolution of active library issue -103 is to make set::iterator a constant iterator; this +103 is to make set::iterator a constant iterator; this means that no set operations can exploit the fact that the stored objects are Assignable.

This is related to, but slightly broader than, closed issue -140. +140.

Proposed resolution:

23.1/3: Strike the trailing part of the sentence:

@@ -8268,7 +8270,7 @@ to forbid such implementations.

Note that the type stored in a standard container must still satisfy the requirements of the container's allocator; this rules out, for -example, such types as "const int". See issue 274 +example, such types as "const int". See issue 274 for more details.

@@ -8280,7 +8282,7 @@ implement vector::push_back in terms of vector::insert.

-

278. What does iterator validity mean?

Section: 23.2.2.4 [lib.list.ops]  Status: WP  Submitter: P.J. Plauger  Date: 27 Nov 2000

+

278. What does iterator validity mean?

Section: 23.2.2.4 [lib.list.ops]  Status: WP  Submitter: P.J. Plauger  Date: 27 Nov 2000

Section 23.2.2.4 [lib.list.ops] states that

@@ -8299,7 +8301,7 @@ validity.

-If we accept the proposed resolution to issue 250, +If we accept the proposed resolution to issue 250, then we'd better clarify that a "valid" iterator need no longer designate an element within the same container as it once did. We then have to clarify what we mean by invalidating a past-the-end @@ -8308,7 +8310,7 @@ such an iterator has a different kind of validity. Perhaps we should introduce separate terms for the two kinds of "validity."

Proposed resolution:

-

Add the following text to the end of section 24.1 [lib.iterator.requirements], +

Add the following text to the end of section 24.1 [lib.iterator.requirements], after paragraph 5:

An invalid iterator is an iterator that may be @@ -8334,10 +8336,10 @@ the wording. Dave provided new wording.]

all iterators pointing into the vector. That doesn't necessarily mean they all become singular.

-

281. std::min() and max() requirements overly restrictive

Section: 25.3.7 [lib.alg.min.max]  Status: WP  Submitter: Martin Sebor  Date: 02 Dec 2000

+

281. std::min() and max() requirements overly restrictive

Section: 25.3.7 [lib.alg.min.max]  Status: WP  Submitter: Martin Sebor  Date: 02 Dec 2000

The requirements in 25.3.7, p1 and 4 call for T to satisfy the -requirements of LessThanComparable (20.1.2 [lib.lessthancomparable]) -and CopyConstructible (20.1.3 [lib.copyconstructible]). +requirements of LessThanComparable (20.1.2 [lib.lessthancomparable]) +and CopyConstructible (20.1.3 [lib.copyconstructible]). Since the functions take and return their arguments and result by const reference, I believe the CopyConstructible requirement is unnecessary. @@ -8346,14 +8348,14 @@ is unnecessary.

Remove the CopyConstructible requirement. Specifically, replace 25.3.7, p1 with

-1- Requires: Type T is LessThanComparable -(20.1.2 [lib.lessthancomparable]). +(20.1.2 [lib.lessthancomparable]).

and replace 25.3.7, p4 with

-4- Requires: Type T is LessThanComparable -(20.1.2 [lib.lessthancomparable]). +(20.1.2 [lib.lessthancomparable]).

-

282. What types does numpunct grouping refer to?

Section: 22.2.2.2.2 [lib.facet.num.put.virtuals]  Status: WP  Submitter: Howard Hinnant  Date: 5 Dec 2000

+

282. What types does numpunct grouping refer to?

Section: 22.2.2.2.2 [lib.facet.num.put.virtuals]  Status: WP  Submitter: Howard Hinnant  Date: 5 Dec 2000

Paragraph 16 mistakenly singles out integral types for inserting thousands_sep() characters. This conflicts with the syntax for floating @@ -8365,7 +8367,7 @@ point numbers described under 22.2.3.1/2.

For integral types, punct.thousands_sep() characters are inserted into the sequence as determined by the value returned by punct.do_grouping() -using the method described in 22.2.3.1.2 [lib.facet.numpunct.virtuals]. +using the method described in 22.2.3.1.2 [lib.facet.numpunct.virtuals].

To:

@@ -8373,7 +8375,7 @@ using the method described in 22.2.3.1.2 [lib.facet.numpunct.virtuals]. +using the method described in 22.2.3.1.2 [lib.facet.numpunct.virtuals].

[ @@ -8397,7 +8399,7 @@ standard. Howard, Bill, Pete, Benjamin, Nathan, Dietmar, Boris, and Martin.]

-

283. std::replace() requirement incorrect/insufficient

Section: 25.2.4 [lib.alg.replace]  Status: WP  Submitter: Martin Sebor  Date: 15 Dec 2000

+

283. std::replace() requirement incorrect/insufficient

Section: 25.2.4 [lib.alg.replace]  Status: WP  Submitter: Martin Sebor  Date: 15 Dec 2000

(revision of the further discussion) There are a number of problems with the requires clauses for the @@ -8544,18 +8546,18 @@ imposing a greater restriction that what the standard currently says (which is convertible to bool).

-

284. unportable example in 20.3.7, p6

Section: 20.3.7 [lib.function.pointer.adaptors]  Status: WP  Submitter: Martin Sebor  Date: 26 Dec 2000

-

The example in 20.3.7 [lib.function.pointer.adaptors], p6 shows how to use the C +

284. unportable example in 20.3.7, p6

Section: 20.3.7 [lib.function.pointer.adaptors]  Status: WP  Submitter: Martin Sebor  Date: 26 Dec 2000

+

The example in 20.3.7 [lib.function.pointer.adaptors], p6 shows how to use the C library function strcmp() with the function pointer adapter ptr_fun(). But since it's unspecified whether the C library functions have extern "C" or extern -"C++" linkage [17.4.2.2 [lib.using.linkage]], and since +"C++" linkage [17.4.2.2 [lib.using.linkage]], and since function pointers with different the language linkage specifications -(7.5 [dcl.link]) are incompatible, whether this example is +(7.5 [dcl.link]) are incompatible, whether this example is well-formed is unspecified.

Proposed resolution:

-

Change 20.3.7 [lib.function.pointer.adaptors] paragraph 6 from:

+

Change 20.3.7 [lib.function.pointer.adaptors] paragraph 6 from:

[Example:

    replace_if(v.begin(), v.end(), not1(bind2nd(ptr_fun(strcmp), "C")), "C++");
@@ -8587,9 +8589,9 @@ aren't normative), and changed the sentence after the footnote so that
 it corresponds to the new code fragment.]

 
 

-
285. minor editorial errors in fstream ctors
Section: 27.8.1.6  [lib.ifstream.cons]  Status: WP  Submitter: Martin Sebor  Date: 31 Dec 2000

-
27.8.1.6  [lib.ifstream.cons], p2, 27.8.1.9  [lib.ofstream.cons], p2, and
-27.8.1.12  [lib.fstream.cons], p2 say about the effects of each constructor:
+
285. minor editorial errors in fstream ctors
Section: 27.8.1.6  [lib.ifstream.cons]  Status: WP  Submitter: Martin Sebor  Date: 31 Dec 2000

+
27.8.1.6  [lib.ifstream.cons], p2, 27.8.1.9  [lib.ofstream.cons], p2, and
+27.8.1.12  [lib.fstream.cons], p2 say about the effects of each constructor:
 

 
 
... If that function returns a null pointer, calls
@@ -8597,7 +8599,7 @@ it corresponds to the new code fragment.]

 

 
 
The parenthetical note doesn't apply since the ctors cannot throw an
-exception due to the requirement in 27.4.4.1  [lib.basic.ios.cons], p3 
+exception due to the requirement in 27.4.4.1  [lib.basic.ios.cons], p3 
 that exceptions() be initialized to ios_base::goodbit.
 

 
Proposed resolution:

@@ -8606,7 +8608,7 @@ Strike the parenthetical note from the Effects clause in each of the
 paragraphs mentioned above.
 

 

-
286. <cstdlib> requirements missing size_t typedef
Section: 25.4  [lib.alg.c.library]  Status: WP  Submitter: Judy Ward  Date: 30 Dec 2000

+
286. <cstdlib> requirements missing size_t typedef
Section: 25.4  [lib.alg.c.library]  Status: WP  Submitter: Judy Ward  Date: 30 Dec 2000

 

 The <cstdlib> header file contains prototypes for bsearch and
 qsort (C++ Standard section 25.4 paragraphs 3 and 4) and other
@@ -8622,7 +8624,7 @@ the type size_t <cstdlib> to Table 97 (section C.2).
 
Rationale:

 
Since size_t is in <stdlib.h>, it must also be in <cstdlib>.

 

-
288. <cerrno> requirements missing macro EILSEQ
Section: 19.3  [lib.errno]  Status: WP  Submitter: Judy Ward  Date: 30 Dec 2000

+
288. <cerrno> requirements missing macro EILSEQ
Section: 19.3  [lib.errno]  Status: WP  Submitter: Judy Ward  Date: 30 Dec 2000

 

 ISO/IEC 9899:1990/Amendment1:1994 Section 4.3 States: "The list
 of macros defined in <errno.h> is adjusted to include a new
@@ -8640,7 +8642,7 @@ Update Table 26 (section 19.3) "Header  <cerrno> synopsis"
 and Table 95 (section C.2) "Standard Macros" to include EILSEQ.
 

 

-
291. Underspecification of set algorithms
Section: 25.3.5  [lib.alg.set.operations]  Status: WP  Submitter: Matt Austern  Date: 03 Jan 2001

+
291. Underspecification of set algorithms
Section: 25.3.5  [lib.alg.set.operations]  Status: WP  Submitter: Matt Austern  Date: 03 Jan 2001

 

 The standard library contains four algorithms that compute set
 operations on sorted ranges: set_union, set_intersection,
@@ -8691,7 +8693,7 @@ same way.
 
 
Proposed resolution:

 
-
Add the following to the end of 25.3.5.2  [lib.set.union] paragraph 5:

+
Add the following to the end of 25.3.5.2  [lib.set.union] paragraph 5:

 

 If [first1, last1) contains m elements that are equivalent to
 each other and [first2, last2) contains n elements that are
@@ -8701,7 +8703,7 @@ from [first1, last1), and the last max(n-m, 0) of them from
 [first2, last2), in that order.
 

 
-
Add the following to the end of 25.3.5.3  [lib.set.intersection] paragraph 5:

+
Add the following to the end of 25.3.5.3  [lib.set.intersection] paragraph 5:

 

 If [first1, last1) contains m elements that are equivalent to each
 other and [first2, last2) contains n elements that are
@@ -8709,7 +8711,7 @@ equivalent to them, the first min(m, n) of those
 elements from [first1, last1) are copied to the output range.
 

 
-
Add a new paragraph, Notes, after 25.3.5.4  [lib.set.difference]
+
Add a new paragraph, Notes, after 25.3.5.4  [lib.set.difference]
 paragraph 4:

 

 If [first1, last1) contains m elements that are equivalent to each
@@ -8718,7 +8720,7 @@ equivalent to them, the last max(m-n, 0) elements from
 [first1, last1) are copied to the output range.
 

 
-
Add a new paragraph, Notes, after 25.3.5.5  [lib.set.symmetric.difference]
+
Add a new paragraph, Notes, after 25.3.5.5  [lib.set.symmetric.difference]
 paragraph 4:

 

 If [first1, last1) contains m elements that are equivalent to
@@ -8741,7 +8743,7 @@ m of these elements from [first2, last2) if m < n.
   already in the Standard.  For more complicated cases, they describe
   the behavior of existing implementations.

 

-
292. effects of a.copyfmt (a)
Section: 27.4.4.2  [lib.basic.ios.members]  Status: WP  Submitter: Martin Sebor  Date: 05 Jan 2001

+
292. effects of a.copyfmt (a)
Section: 27.4.4.2  [lib.basic.ios.members]  Status: WP  Submitter: Martin Sebor  Date: 05 Jan 2001

 
The Effects clause of the member function copyfmt() in
 27.4.4.2, p15 doesn't consider the case where the left-hand side
 argument is identical to the argument on the right-hand side, that is
@@ -8769,7 +8771,7 @@ assigns to the member objects of *this the corresponding member
 objects of rhs, except that...
 

 

-
295. Is abs defined in <cmath>?
Section: 26.5  [lib.c.math]  Status: WP  Submitter: Jens Maurer  Date: 12 Jan 2001

+
295. Is abs defined in <cmath>?
Section: 26.5  [lib.c.math]  Status: WP  Submitter: Jens Maurer  Date: 12 Jan 2001

 

 Table 80 lists the contents of the <cmath> header.  It does not
 list abs().  However, 26.5, paragraph 6, which lists added 
@@ -8779,7 +8781,7 @@ of abs() should be defined in <cmath>.
 
Proposed resolution:

 

 Add abs to Table 80.  Also, remove the parenthetical list
-of functions "(abs(), div(), rand(), srand())" from 26.5  [lib.c.math],
+of functions "(abs(), div(), rand(), srand())" from 26.5  [lib.c.math],
 paragraph 1.
 

 
@@ -8790,9 +8792,9 @@ rid of that vestigial list of functions in paragraph 1.]

 
All this DR does is fix a typo; it's uncontroversial.  A 
 separate question is whether we're doing the right thing in 
 putting some overloads in <cmath> that we aren't also 
-putting in <cstdlib>.  That's issue 323.

+putting in <cstdlib>.  That's issue 323.

 

-
297. const_mem_fun_t<>::argument_type should be const T*
Section: 20.3.8  [lib.member.pointer.adaptors]  Status: WP  Submitter: Martin Sebor  Date: 6 Jan 2001

+
297. const_mem_fun_t<>::argument_type should be const T*
Section: 20.3.8  [lib.member.pointer.adaptors]  Status: WP  Submitter: Martin Sebor  Date: 6 Jan 2001

 
The class templates const_mem_fun_t in 20.3.8, p8 and
 const_mem_fun1_t
 in 20.3.8, p9 derive from unary_function<T*, S>, and
@@ -8862,7 +8864,7 @@ binary_function<const T*, A, S> {
 
This is simply a contradiction: the argument_type typedef,
 and the argument type itself, are not the same.

 

-
298. ::operator delete[] requirement incorrect/insufficient
Section: 18.4.1.2  [lib.new.delete.array]  Status: WP  Submitter: John A. Pedretti  Date: 10 Jan 2001

+
298. ::operator delete[] requirement incorrect/insufficient
Section: 18.4.1.2  [lib.new.delete.array]  Status: WP  Submitter: John A. Pedretti  Date: 10 Jan 2001

 

 The default behavior of operator delete[] described in 18.4.1.2, p12 -
 namely that for non-null value of ptr, the operator reclaims storage
@@ -8885,7 +8887,7 @@ For a null value of ptr , does nothing.
 Any other value of ptr shall be a value returned
 earlier by a call to the default operator new[](std::size_t).
 [Footnote: The value must not have been invalidated by an intervening
-call to operator delete[](void*) (17.4.3.7  [lib.res.on.arguments]).
+call to operator delete[](void*) (17.4.3.7  [lib.res.on.arguments]).
 --- end footnote]
 For such a non-null value of ptr , reclaims storage
 allocated by the earlier call to the default operator new[].
@@ -8902,7 +8904,7 @@ or operator delete(ptr, std::nothrow) respectively.

and expunge paragraph 13.

-

300. list::merge() specification incomplete

Section: 23.2.2.4 [lib.list.ops]  Status: WP  Submitter: John Pedretti  Date: 23 Jan 2001

+

300. list::merge() specification incomplete

Section: 23.2.2.4 [lib.list.ops]  Status: WP  Submitter: John Pedretti  Date: 23 Jan 2001

The "Effects" clause for list::merge() (23.2.2.4, p23) appears to be incomplete: it doesn't cover the case where the argument @@ -8911,7 +8913,7 @@ note in p24 (below) is that x be empty after the merge which is surely unintended in this case.

Proposed resolution:

-

In 23.2.2.4 [lib.list.ops], replace paragraps 23-25 with:

+

In 23.2.2.4 [lib.list.ops], replace paragraps 23-25 with:

23 Effects: if (&x == this) does nothing; otherwise, merges the two @@ -8940,7 +8942,7 @@ effects.

[Copenhagen: The original proposed resolution did not fix all of -the problems in 23.2.2.4 [lib.list.ops], p22-25. Three different +the problems in 23.2.2.4 [lib.list.ops], p22-25. Three different paragraphs (23, 24, 25) describe the effects of merge. Changing p23, without changing the other two, appears to introduce contradictions. Additionally, "merges the argument list into the @@ -8949,7 +8951,7 @@ list" is excessively vague.]

[Post-Curaçao: Robert Klarer provided new wording.]

-

301. basic_string template ctor effects clause omits allocator argument

Section: 21.3.1 [lib.string.cons]  Status: WP  Submitter: Martin Sebor  Date: 27 Jan 2001

+

301. basic_string template ctor effects clause omits allocator argument

Section: 21.3.1 [lib.string.cons]  Status: WP  Submitter: Martin Sebor  Date: 27 Jan 2001

The effects clause for the basic_string template ctor in 21.3.1, p15 leaves out the third argument of type Allocator. I believe this to be @@ -8976,7 +8978,7 @@ a mistake. static_cast<value_type>(end), a)

-

303. Bitset input operator underspecified

Section: 23.3.5.3 [lib.bitset.operators]  Status: WP  Submitter: Matt Austern  Date: 5 Feb 2001

+

303. Bitset input operator underspecified

Section: 23.3.5.3 [lib.bitset.operators]  Status: WP  Submitter: Matt Austern  Date: 5 Feb 2001

In 23.3.5.3, we are told that bitset's input operator "Extracts up to N (single-byte) characters from @@ -9081,7 +9083,7 @@ input. Using widen does mean that alternative digit representations will not be recognized, but this was a known consequence of the design choice.

-

305. Default behavior of codecvt<wchar_t, char, mbstate_t>::length()

Section: 22.2.1.5.2 [lib.locale.codecvt.virtuals]  Status: WP  Submitter: Howard Hinnant  Date: 24 Jan 2001

+

305. Default behavior of codecvt<wchar_t, char, mbstate_t>::length()

Section: 22.2.1.5.2 [lib.locale.codecvt.virtuals]  Status: WP  Submitter: Howard Hinnant  Date: 24 Jan 2001

22.2.1.5/3 introduces codecvt in part with:

@@ -9193,7 +9195,7 @@ example, and it would rule out a fixed-width encoding of UCS-4.

"shift-JIS" changed to "JIS".]

-

306. offsetof macro and non-POD types

Section: 18.1 [lib.support.types]  Status: WP  Submitter: Steve Clamage  Date: 21 Feb 2001

+

306. offsetof macro and non-POD types

Section: 18.1 [lib.support.types]  Status: WP  Submitter: Steve Clamage  Date: 21 Feb 2001

Spliced together from reflector messages c++std-lib-8294 and -8295:

18.1, paragraph 5, reads: "The macro offsetof @@ -9204,7 +9206,7 @@ that is a static data member or a function member is undefined."

For the POD requirement, it doesn't say "no diagnostic -required" or "undefined behavior". I read 1.4 [intro.compliance], paragraph 1, to mean that a diagnostic is required. +required" or "undefined behavior". I read 1.4 [intro.compliance], paragraph 1, to mean that a diagnostic is required. It's not clear whether this requirement was intended. While it's possible to provide such a diagnostic, the extra complication doesn't seem to add any value. @@ -9219,13 +9221,13 @@ members thought that diagnostics should be required whenever possible.]

-

307. Lack of reference typedefs in container adaptors

Section: 23.2.3 [lib.container.adaptors]  Status: WP  Submitter: Howard Hinnant  Date: 13 Mar 2001

+

307. Lack of reference typedefs in container adaptors

Section: 23.2.3 [lib.container.adaptors]  Status: WP  Submitter: Howard Hinnant  Date: 13 Mar 2001

From reflector message c++std-lib-8330. See also lib-8317.

-The standard is currently inconsistent in 23.2.3.2 [lib.priority.queue] -paragraph 1 and 23.2.3.3 [lib.stack] paragraph 1. +The standard is currently inconsistent in 23.2.3.2 [lib.priority.queue] +paragraph 1 and 23.2.3.3 [lib.stack] paragraph 1. 23.2.3.3/1, for example, says:

@@ -9251,7 +9253,7 @@ container's reference type.

I propose 3. This does not preclude option 2 if we choose to do it -later (see issue 96); the issues are independent. Option +later (see issue 96); the issues are independent. Option 3 offers a small step towards support for proxied containers. This small step fixes a current contradiction, is easy for vendors to implement, is already implemented in at least one popular lib, and @@ -9480,14 +9482,14 @@ and it was deliberately not adopted. Nevertheless, the LWG believes (straw poll: 10-2) that it is a genuine defect.]

-

308. Table 82 mentions unrelated headers

Section: 27 [lib.input.output]  Status: WP  Submitter: Martin Sebor  Date: 15 Mar 2001

+

308. Table 82 mentions unrelated headers

Section: 27 [lib.input.output]  Status: WP  Submitter: Martin Sebor  Date: 15 Mar 2001

Table 82 in section 27 mentions the header <cstdlib> for String -streams (27.7 [lib.string.streams]) and the headers <cstdio> and -<cwchar> for File streams (27.8 [lib.file.streams]). It's not clear +streams (27.7 [lib.string.streams]) and the headers <cstdio> and +<cwchar> for File streams (27.8 [lib.file.streams]). It's not clear why these headers are mentioned in this context since they do not define any of the library entities described by the -subclauses. According to 17.4.1.1 [lib.contents], only such headers +subclauses. According to 17.4.1.1 [lib.contents], only such headers are to be listed in the summary.

Proposed resolution:

@@ -9497,10 +9499,10 @@ Table 82.

[Copenhagen: changed the proposed resolution slightly. The original proposed resolution also said to remove <cstdio> from Table 82. However, <cstdio> is mentioned several times within -section 27.8 [lib.file.streams], including 27.8.2 [lib.c.files].]

+section 27.8 [lib.file.streams], including 27.8.2 [lib.c.files].]

-

310. Is errno a macro?

Section: 17.4.1.2 [lib.headers], 19.3 [lib.errno]  Status: WP  Submitter: Steve Clamage  Date: 21 Mar 2001

+

310. Is errno a macro?

Section: 17.4.1.2 [lib.headers], 19.3 [lib.errno]  Status: WP  Submitter: Steve Clamage  Date: 21 Mar 2001

Exactly how should errno be declared in a conforming C++ header?

@@ -9587,9 +9589,9 @@ to be a macro.

[Curaçao: additional rationale added.]

-

311. Incorrect wording in basic_ostream class synopsis

Section: 27.6.2.1 [lib.ostream]  Status: WP  Submitter: Andy Sawyer  Date: 21 Mar 2001

+

311. Incorrect wording in basic_ostream class synopsis

Section: 27.6.2.1 [lib.ostream]  Status: WP  Submitter: Andy Sawyer  Date: 21 Mar 2001

-

In 27.6.2.1 [lib.ostream], the synopsis of class basic_ostream says:

+

In 27.6.2.1 [lib.ostream], the synopsis of class basic_ostream says:

  // partial specializationss
   template<class traits>
@@ -9604,29 +9606,29 @@ to be a macro.

 
 
 
Proposed resolution:

-
In the synopsis in 27.6.2.1  [lib.ostream], remove the 
+
In the synopsis in 27.6.2.1  [lib.ostream], remove the 
 // partial specializationss comment.  Also remove the same 
 comment (correctly spelled, but still incorrect) from the synopsis in 
-27.6.2.5.4  [lib.ostream.inserters.character].
+27.6.2.5.4  [lib.ostream.inserters.character].
 

 
 
[
-Pre-Redmond: added 27.6.2.5.4  [lib.ostream.inserters.character] because of Martin's
+Pre-Redmond: added 27.6.2.5.4  [lib.ostream.inserters.character] because of Martin's
 comment in c++std-lib-8939.
 ]

 
 

-
312. Table 27 is missing headers
Section: 20  [lib.utilities]  Status: WP  Submitter: Martin Sebor  Date: 29 Mar 2001

+
312. Table 27 is missing headers
Section: 20  [lib.utilities]  Status: WP  Submitter: Martin Sebor  Date: 29 Mar 2001

 
Table 27 in section 20 lists the header <memory> (only) for
 Memory (lib.memory) but neglects to mention the headers
-<cstdlib> and <cstring> that are discussed in 20.4.6  [lib.c.malloc].

+<cstdlib> and <cstring> that are discussed in 20.4.6  [lib.c.malloc].

 
Proposed resolution:

 
Add <cstdlib> and <cstring> to Table 27, in the same row
 as <memory>.

 

-
315. Bad "range" in list::unique complexity
Section: 23.2.2.4  [lib.list.ops]  Status: WP  Submitter: Andy Sawyer  Date: 1 May 2001

+
315. Bad "range" in list::unique complexity
Section: 23.2.2.4  [lib.list.ops]  Status: WP  Submitter: Andy Sawyer  Date: 1 May 2001

 

-23.2.2.4  [lib.list.ops], Para 21 describes the complexity of
+23.2.2.4  [lib.list.ops], Para 21 describes the complexity of
 list::unique as: "If the range (last - first) is not empty, exactly
 (last - first) -1 applications of the corresponding predicate,
 otherwise no applications of the predicate)".
@@ -9640,7 +9642,7 @@ otherwise no applications of the predicate)".
 Change the "range" from (last - first) to [first, last).
 

 

-
316. Vague text in Table 69
Section: 23.1.2  [lib.associative.reqmts]  Status: WP  Submitter: Martin Sebor  Date: 4 May 2001

+
316. Vague text in Table 69
Section: 23.1.2  [lib.associative.reqmts]  Status: WP  Submitter: Martin Sebor  Date: 4 May 2001

 
Table 69 says this about a_uniq.insert(t):

 
 

@@ -9660,7 +9662,7 @@ indicates whether the insertion takes place.

 takes place...
 

 

-
317. Instantiation vs. specialization of facets
Section: 22  [lib.localization]  Status: WP  Submitter: Martin Sebor  Date: 4 May 2001

+
317. Instantiation vs. specialization of facets
Section: 22  [lib.localization]  Status: WP  Submitter: Martin Sebor  Date: 4 May 2001

 

 The localization section of the standard refers to specializations of
 the facet templates as instantiations even though the required facets
@@ -9709,7 +9711,7 @@ describe templates was clarified during the standardization process,
 but the wording in clause 22 was never updated to reflect that
 change.

 

-
318. Misleading comment in definition of numpunct_byname
Section: 22.2.3.2  [lib.locale.numpunct.byname]  Status: WP  Submitter: Martin Sebor  Date: 12 May 2001

+
318. Misleading comment in definition of numpunct_byname
Section: 22.2.3.2  [lib.locale.numpunct.byname]  Status: WP  Submitter: Martin Sebor  Date: 12 May 2001

 
The definition of the numpunct_byname template contains the following
 comment:

 
@@ -9725,14 +9727,14 @@ conceivable that an implementation will not explicitly specialize the
 template at all, but simply provide the primary template.

 
Proposed resolution:

 
Remove the comment from the text in 22.2.3.2 and from the proposed
-resolution of library issue 228.

+resolution of library issue 228.

 

-
319. Storage allocation wording confuses "Required behavior", "Requires"
Section: 18.4.1.1  [lib.new.delete.single], 18.4.1.2  [lib.new.delete.array]  Status: WP  Submitter: Beman Dawes  Date: 15 May 2001

-
The standard specifies 17.3.1.3  [lib.structure.specifications] that "Required
+
319. Storage allocation wording confuses "Required behavior", "Requires"
Section: 18.4.1.1  [lib.new.delete.single], 18.4.1.2  [lib.new.delete.array]  Status: WP  Submitter: Beman Dawes  Date: 15 May 2001

+
The standard specifies 17.3.1.3  [lib.structure.specifications] that "Required
 behavior" elements describe "the semantics of a function definition
 provided by either the implementation or a C++ program."

 
-
The standard specifies 17.3.1.3  [lib.structure.specifications] that "Requires"
+
The standard specifies 17.3.1.3  [lib.structure.specifications] that "Requires"
 elements describe "the preconditions for calling the function."

 
 
In the sections noted below, the current wording specifies
@@ -9741,7 +9743,7 @@ should be specified as "Requires".

 
 
Proposed resolution:

 
-
In 18.4.1.1  [lib.new.delete.single] Para 12 Change:

+
In 18.4.1.1  [lib.new.delete.single] Para 12 Change:

 

   
Required behavior: accept a value of ptr that is null or that was
   returned by an earlier call ...

@@ -9752,7 +9754,7 @@ should be specified as "Requires".

   earlier call ...

 

 
-
In 18.4.1.2  [lib.new.delete.array] Para 11 Change:

+
In 18.4.1.2  [lib.new.delete.array] Para 11 Change:

 

   
Required behavior: accept a value of ptr that is null or that was
   returned by an earlier call ...

@@ -9764,7 +9766,7 @@ should be specified as "Requires".

 

 
 

-
320. list::assign overspecified
Section: 23.2.2.1  [lib.list.cons]  Status: WP  Submitter: Howard Hinnant  Date: 17 May 2001

+
320. list::assign overspecified
Section: 23.2.2.1  [lib.list.cons]  Status: WP  Submitter: Howard Hinnant  Date: 17 May 2001

 

 Section 23.2.2.1, paragraphs 6-8 specify that list assign (both forms) have
 the "effects" of a call to erase followed by a call to insert.
@@ -9806,7 +9808,7 @@ Metrowerks and SGI recycle nodes, Dinkumware and Rogue Wave don't.
 
Effects: Replaces the contents of the list with the range [first, last).
-

In 23.1.1 [lib.sequence.reqmts], in Table 67 (sequence requirements), +

In 23.1.1 [lib.sequence.reqmts], in Table 67 (sequence requirements), add two new rows:

      a.assign(i,j)     void      pre: i,j are not iterators into a.
                                   Replaces elements in a with a copy
@@ -9847,7 +9849,7 @@ with "Replaces the elements of a with a copy of [i, j)."
 Changes not deemed serious enough to requre rereview.]

 
 

-
321. Typo in num_get
Section: 22.2.2.1.2  [lib.facet.num.get.virtuals]  Status: WP  Submitter: Kevin Djang  Date: 17 May 2001

+
321. Typo in num_get
Section: 22.2.2.1.2  [lib.facet.num.get.virtuals]  Status: WP  Submitter: Kevin Djang  Date: 17 May 2001

 

 Section 22.2.2.1.2 at p7 states that "A length specifier is added to
 the conversion function, if needed, as indicated in Table 56."
@@ -9862,7 +9864,7 @@ to be "A length modifier is added ..."
 
Rationale:

 
C uses the term "length modifier".  We should be consistent.

 

-
322. iterator and const_iterator should have the same value type
Section: 23.1  [lib.container.requirements]  Status: WP  Submitter: Matt Austern  Date: 17 May 2001

+
322. iterator and const_iterator should have the same value type
Section: 23.1  [lib.container.requirements]  Status: WP  Submitter: Matt Austern  Date: 17 May 2001

 

 It's widely assumed that, if X is a container,
 iterator_traits<X::iterator>::value_type and
@@ -9874,7 +9876,7 @@ iterator_traits<X::const_iterator>::value_type should be "const
 X::value_type".
 

 
-
Related issue: 279.

+
Related issue: 279.

 
Proposed resolution:

 
In Table 65 ("Container Requirements"), change the return type for
 X::iterator to "iterator type whose value type is T".  Change the
@@ -9894,7 +9896,7 @@ the way that const pointers are handled: the standard already
 requires that iterator_traits<const int*>::value_type is int.
 

 

-
324. Do output iterators have value types?
Section: 24.1.2  [lib.output.iterators]  Status: WP  Submitter: Dave Abrahams  Date: 7 June 2001

+
324. Do output iterators have value types?
Section: 24.1.2  [lib.output.iterators]  Status: WP  Submitter: Dave Abrahams  Date: 7 June 2001

 
 
Table 73 suggests that output iterators have value types.  It 
 requires the expression "*a = t".  Additionally, although Table 73
@@ -10012,7 +10014,7 @@ and any language suggesting otherwise is simply a mistake.

 
A future revision of the standard may wish to revisit this design
 decision.

 

-
325. Misleading text in moneypunct<>::do_grouping
Section: 22.2.6.3.2  [lib.locale.moneypunct.virtuals]  Status: WP  Submitter: Martin Sebor  Date: 02 Jul 2001

+
325. Misleading text in moneypunct<>::do_grouping
Section: 22.2.6.3.2  [lib.locale.moneypunct.virtuals]  Status: WP  Submitter: Martin Sebor  Date: 02 Jul 2001

 
The Returns clause in 22.2.6.3.2, p3 says about
 moneypunct<charT>::do_grouping()
 

@@ -10064,7 +10066,7 @@ locale. It is just a reminder that the values are interpreted as small
 integers, not ASCII characters.
 

 

-
327. Typo in time_get facet in table 52
Section: 22.1.1.1.1  [lib.locale.category]  Status: WP  Submitter: Tiki Wan  Date: 06 Jul 2001

+
327. Typo in time_get facet in table 52
Section: 22.1.1.1.1  [lib.locale.category]  Status: WP  Submitter: Tiki Wan  Date: 06 Jul 2001

 
The wchar_t versions of time_get and
 time_get_byname are listed incorrectly in table 52,
 required instantiations.  In both cases the second template
@@ -10073,7 +10075,7 @@ InputIterator, since these are input facets.

 
Proposed resolution:

 

 In table 52, required instantiations, in 
-22.1.1.1.1  [lib.locale.category], change

+22.1.1.1.1  [lib.locale.category], change

 
    time_get<wchar_t, OutputIterator>
     time_get_byname<wchar_t, OutputIterator>
 

@@ -10086,7 +10088,7 @@ In table 52, required instantiations, in
 a typo, wchart instead of wchar_t.]

 
 

-
328. Bad sprintf format modifier in money_put<>::do_put()
Section: 22.2.6.2.2  [lib.locale.money.put.virtuals]  Status: WP  Submitter: Martin Sebor  Date: 07 Jul 2001

+
328. Bad sprintf format modifier in money_put<>::do_put()
Section: 22.2.6.2.2  [lib.locale.money.put.virtuals]  Status: WP  Submitter: Martin Sebor  Date: 07 Jul 2001

 
The sprintf format string , "%.01f" (that's the digit one), in the
 description of the do_put() member functions of the money_put facet in
 22.2.6.2.2, p1 is incorrect. First, the f format specifier is wrong
@@ -10099,11 +10101,11 @@ modifier.

 
Rationale:

 
Fixes an obvious typo

 

-
329. vector capacity, reserve and reallocation
Section: 23.2.4.2  [lib.vector.capacity], 23.2.4.3  [lib.vector.modifiers]  Status: WP  Submitter: Anthony Williams  Date: 13 Jul 2001

+
329. vector capacity, reserve and reallocation
Section: 23.2.4.2  [lib.vector.capacity], 23.2.4.3  [lib.vector.modifiers]  Status: WP  Submitter: Anthony Williams  Date: 13 Jul 2001

 

 There is an apparent contradiction about which circumstances can cause
-a reallocation of a vector in Section 23.2.4.2  [lib.vector.capacity] and
-section 23.2.4.3  [lib.vector.modifiers].
+a reallocation of a vector in Section 23.2.4.2  [lib.vector.capacity] and
+section 23.2.4.3  [lib.vector.modifiers].
 

 
 
23.2.4.2p5 says:

@@ -10155,7 +10157,7 @@ than the old capacity, I think the intent is clear.
 

 
 
Proposed resolution:

-
Change the wording of 23.2.4.2  [lib.vector.capacity] paragraph 5 to:

+
Change the wording of 23.2.4.2  [lib.vector.capacity] paragraph 5 to:

 
 

 Notes: Reallocation invalidates all the references, pointers, and
@@ -10179,12 +10181,12 @@ the argument to the first, the intent was for the second invocation to
 have no effect.  Wording implying that such cases have an effect on
 reallocation guarantees was inadvertant.

 

-
331. bad declaration of destructor for ios_base::failure
Section: 27.4.2.1.1  [lib.ios::failure]  Status: WP  Submitter: PremAnand M. Rao  Date: 23 Aug 2001

+
331. bad declaration of destructor for ios_base::failure
Section: 27.4.2.1.1  [lib.ios::failure]  Status: WP  Submitter: PremAnand M. Rao  Date: 23 Aug 2001

 

-With the change in 17.4.4.8  [lib.res.on.exception.handling] to state
+With the change in 17.4.4.8  [lib.res.on.exception.handling] to state
    "An implementation may strengthen the exception-specification for a 
     non-virtual function by removing listed exceptions."
-(issue 119)
+(issue 119)
 and the following declaration of ~failure() in ios_base::failure
 

 
    namespace std {
@@ -10196,7 +10198,7 @@ and the following declaration of ~failure() in ios_base::failure
        };
      }
 

-
the class failure cannot be implemented since in 18.6.1  [lib.exception] the destructor of class exception has an empty
+
the class failure cannot be implemented since in 18.6.1  [lib.exception] the destructor of class exception has an empty
 exception specification:

 
    namespace std {
        class exception {
@@ -10213,8 +10215,8 @@ exception specification:

 
The proposed resolution is consistent with the way that destructors
 of other classes derived from exception are handled.

 

-
333. does endl imply synchronization with the device?
Section: 27.6.2.7  [lib.ostream.manip]  Status: WP  Submitter: PremAnand M. Rao  Date: 27 Aug 2001

-
A footnote in 27.6.2.7  [lib.ostream.manip] states:

+
333. does endl imply synchronization with the device?
Section: 27.6.2.7  [lib.ostream.manip]  Status: WP  Submitter: PremAnand M. Rao  Date: 27 Aug 2001

+
A footnote in 27.6.2.7  [lib.ostream.manip] states:

 

     [Footnote: The effect of executing cout << endl is to insert a 
      newline character in the output sequence controlled by cout, then 
@@ -10239,7 +10241,7 @@ I could not find any other statement that explicitly defined
 the behavior one way or the other.
 

 
Proposed resolution:

-
Remove footnote 300 from section 27.6.2.7  [lib.ostream.manip].

+
Remove footnote 300 from section 27.6.2.7  [lib.ostream.manip].

 
Rationale:

 
We already have normative text saying what endl does: it
 inserts a newline character and calls flush.  This footnote
@@ -10247,7 +10249,7 @@ is at best redundant, at worst (as this issue says) misleading,
 because it appears to make promises about what flush
 does.

 

-
334. map::operator[] specification forces inefficient implementation
Section: 23.3.1.2  [lib.map.access]  Status: WP  Submitter: Andrea Griffini  Date: 02 Sep 2001

+
334. map::operator[] specification forces inefficient implementation
Section: 23.3.1.2  [lib.map.access]  Status: WP  Submitter: Andrea Griffini  Date: 02 Sep 2001

 

 The current standard describes map::operator[] using a
 code example. That code example is however quite
@@ -10324,7 +10326,7 @@ non-conforming.
 
Proposed resolution:

 
 

-Replace 23.3.1.2  [lib.map.access] paragraph 1 with
+Replace 23.3.1.2  [lib.map.access] paragraph 1 with
 

 

 

@@ -10343,7 +10345,7 @@ value_type(x, T()) into the map.
 wording.  We may also wish to have a blanket statement somewhere in
 clause 17 saying that we do not intend the semantics of sample code
 fragments to be interpreted as specifing exactly how many copies are
-made.  See issue 98 for a similar problem.]

+made.  See issue 98 for a similar problem.]

 
 
Rationale:

 

@@ -10355,9 +10357,9 @@ consistent with existing practice.
 we are no longer defining operator[] in terms of
 insert.

 

-
335. minor issue with char_traits, table 37
Section: 21.1.1  [lib.char.traits.require]  Status: WP  Submitter: Andy Sawyer  Date: 06 Sep 2001

+
335. minor issue with char_traits, table 37
Section: 21.1.1  [lib.char.traits.require]  Status: WP  Submitter: Andy Sawyer  Date: 06 Sep 2001

 

-Table 37, in 21.1.1  [lib.char.traits.require], descibes char_traits::assign
+Table 37, in 21.1.1  [lib.char.traits.require], descibes char_traits::assign
 as:
 

 
  X::assign(c,d)   assigns c = d.
@@ -10394,10 +10396,10 @@ and char_traits<wchar_t> in 21.1.3.2...)
 
  X::assign(r,d)   assigns r = d
 

 

-
336. Clause 17 lack of references to deprecated headers
Section: 17  [lib.library]  Status: WP  Submitter: Detlef Vollmann  Date: 05 Sep 2001

+
336. Clause 17 lack of references to deprecated headers
Section: 17  [lib.library]  Status: WP  Submitter: Detlef Vollmann  Date: 05 Sep 2001

 
From c++std-edit-873:

 
-
17.4.1.2  [lib.headers], Table 11.  In this table, the header
+
17.4.1.2  [lib.headers], Table 11.  In this table, the header
 <strstream> is missing.

 
 
This shows a general problem: The whole clause 17 refers quite
@@ -10406,47 +10408,47 @@ library (though a deprecated one).

 
 
Proposed resolution:

 
-
To 17.4.1.2  [lib.headers] Table 11, C++ Library Headers, add
+
To 17.4.1.2  [lib.headers] Table 11, C++ Library Headers, add
 "<strstream>".

 
 
In the following places, change "clauses 17 through 27" to "clauses
 17 through 27 and Annex D":

 
 
 
 
 

-
337. replace_copy_if's template parameter should be InputIterator
Section: 25.2.4  [lib.alg.replace]  Status: WP  Submitter: Detlef Vollmann  Date: 07 Sep 2001

+
337. replace_copy_if's template parameter should be InputIterator
Section: 25.2.4  [lib.alg.replace]  Status: WP  Submitter: Detlef Vollmann  Date: 07 Sep 2001

 
From c++std-edit-876:

 
 

-In section 25.2.4  [lib.alg.replace] before p4: The name of the first
+In section 25.2.4  [lib.alg.replace] before p4: The name of the first
 parameter of template replace_copy_if should be "InputIterator"
-instead of "Iterator".  According to 17.3.2.1  [lib.type.descriptions] p1 the
+instead of "Iterator".  According to 17.3.2.1  [lib.type.descriptions] p1 the
 parameter name conveys real normative meaning.
 

 
Proposed resolution:

 
Change Iterator to InputIterator.

 

-
338.  is whitespace allowed between `-' and a digit?
Section: 22.2  [lib.locale.categories]  Status: WP  Submitter: Martin Sebor  Date: 17 Sep 2001

+
338.  is whitespace allowed between `-' and a digit?
Section: 22.2  [lib.locale.categories]  Status: WP  Submitter: Martin Sebor  Date: 17 Sep 2001

 

->From Stage 2 processing in 22.2.2.1.2  [lib.facet.num.get.virtuals], p8 and 9 (the
+From Stage 2 processing in 22.2.2.1.2  [lib.facet.num.get.virtuals], p8 and 9 (the
 original text or the text corrected by the proposed resolution of
-issue 221) it seems clear that no whitespace is allowed
-within a number, but 22.2.3.1  [lib.locale.numpunct], p2, which gives the
+issue 221) it seems clear that no whitespace is allowed
+within a number, but 22.2.3.1  [lib.locale.numpunct], p2, which gives the
 format for integer and floating point values, says that whitespace is
 optional between a plusminus and a sign.
 

@@ -10456,10 +10458,10 @@ The text needs to be clarified to either consistently allow or
 disallow whitespace between a plusminus and a sign. It might be
 worthwhile to consider the fact that the C library stdio facility does
 not permit whitespace embedded in numbers and neither does the C or
-C++ core language (the syntax of integer-literals is given in 2.13.1  [lex.icon], that of floating-point-literals in 2.13.3  [lex.fcon] of the C++ standard).
+C++ core language (the syntax of integer-literals is given in 2.13.1  [lex.icon], that of floating-point-literals in 2.13.3  [lex.fcon] of the C++ standard).
 

 
Proposed resolution:

-
Change the first part of 22.2.3.1  [lib.locale.numpunct] paragraph 2 from:

+
Change the first part of 22.2.3.1  [lib.locale.numpunct] paragraph 2 from:

 

 

 The syntax for number formats is as follows, where digit
@@ -10494,16 +10496,16 @@ Integer values have the format:
 

 

 
Rationale:

-
It's not clear whether the format described in 22.2.3.1  [lib.locale.numpunct] paragraph 2 has any normative weight: nothing in the
+
It's not clear whether the format described in 22.2.3.1  [lib.locale.numpunct] paragraph 2 has any normative weight: nothing in the
 standard says how, or whether, it's used.  However, there's no reason
 for it to differ gratuitously from the very specific description of
-numeric processing in 22.2.2.1.2  [lib.facet.num.get.virtuals].  The proposed
+numeric processing in 22.2.2.1.2  [lib.facet.num.get.virtuals].  The proposed
 resolution removes all mention of "whitespace" from that format.

 

-
339. definition of bitmask type restricted to clause 27
Section: 22.2.1  [lib.category.ctype], 17.3.2.1.2  [lib.bitmask.types]  Status: WP  Submitter: Martin Sebor  Date: 17 September 2001

+
339. definition of bitmask type restricted to clause 27
Section: 22.2.1  [lib.category.ctype], 17.3.2.1.2  [lib.bitmask.types]  Status: WP  Submitter: Martin Sebor  Date: 17 September 2001

 

-The ctype_category::mask type is declared to be an enum in 22.2.1  [lib.category.ctype] with p1 then stating that it is a bitmask type, most
-likely referring to the definition of bitmask type in 17.3.2.1.2  [lib.bitmask.types], p1. However, the said definition only applies to
+The ctype_category::mask type is declared to be an enum in 22.2.1  [lib.category.ctype] with p1 then stating that it is a bitmask type, most
+likely referring to the definition of bitmask type in 17.3.2.1.2  [lib.bitmask.types], p1. However, the said definition only applies to
 clause 27, making the reference in 22.2.1 somewhat dubious.
 

 
Proposed resolution:

@@ -10511,7 +10513,7 @@ clause 27, making the reference in 22.2.1 somewhat dubious.
     

     Several types defined in clause 27 are bitmask types. Each bitmask type
     can be implemented as an enumerated type that overloads certain operators,
-    as an integer type, or as a bitset (23.3.5  [lib.template.bitset]).
+    as an integer type, or as a bitset (23.3.5  [lib.template.bitset]).
     

 
to read

     

@@ -10551,7 +10553,7 @@ following (note, in particluar, the cross-reference to 17.3.2.1.2 in
 }
 

 
-
The type mask is a bitmask type (17.3.2.1.2  [lib.bitmask.types]).

+
The type mask is a bitmask type (17.3.2.1.2  [lib.bitmask.types]).

 

 
 
[Curaçao: The LWG notes that T above should be bold-italics to be
@@ -10559,7 +10561,7 @@ consistent with the rest of the standard.]

 
 

 
340. interpretation of has_facet<Facet>(loc)
-
Section: 22.1.1.1.1  [lib.locale.category]  Status: WP  Submitter: Martin Sebor  Date: 18 Sep 2001

+
Section: 22.1.1.1.1  [lib.locale.category]  Status: WP  Submitter: Martin Sebor  Date: 18 Sep 2001

 

 It's unclear whether 22.1.1.1.1, p3 says that
 has_facet<Facet>(loc) returns true for any Facet
@@ -10606,7 +10608,7 @@ to hold only for specializations of Facet from Table 52 on
 }.
 

 
Proposed resolution:

-
In 22.1.1.1.1  [lib.locale.category], paragraph 3, change
+
In 22.1.1.1.1  [lib.locale.category], paragraph 3, change
 "that is a member of a standard category" to "shown in Table 51".

 
Rationale:

 
The facets in Table 52 are an unbounded set.  Locales should not be
@@ -10616,7 +10618,7 @@ required to contain an infinite number of facets.

 OutputIterator must be supported.  Table 51 already contains a
 complete list of the ones we need.

 

-
341. Vector reallocation and swap
Section: 23.2.4.2  [lib.vector.capacity]  Status: WP  Submitter: Anthony Williams  Date: 27 Sep 2001

+
341. Vector reallocation and swap
Section: 23.2.4.2  [lib.vector.capacity]  Status: WP  Submitter: Anthony Williams  Date: 27 Sep 2001

 
It is a common idiom to reduce the capacity of a vector by swapping it with
 an empty one:

 
  std::vector<SomeType> vec;
@@ -10625,16 +10627,16 @@ an empty one:

   // vec is now empty, with minimal capacity
 

 
-
However, the wording of 23.2.4.2  [lib.vector.capacity]paragraph 5 prevents
+
However, the wording of 23.2.4.2  [lib.vector.capacity]paragraph 5 prevents
 the capacity of a vector being reduced, following a call to
 reserve(). This invalidates the idiom, as swap() is thus prevented
-from reducing the capacity. The proposed wording for issue 329 does not affect this.  Consequently, the example above
+from reducing the capacity. The proposed wording for issue 329 does not affect this.  Consequently, the example above
 requires the temporary to be expanded to cater for the contents of
 vec, and the contents be copied across. This is a linear-time
 operation.

 
 
However, the container requirements state that swap must have constant
-complexity (23.1  [lib.container.requirements] note to table 65).

+complexity (23.1  [lib.container.requirements] note to table 65).

 
 
This is an important issue, as reallocation affects the validity of
 references and iterators.

@@ -10656,7 +10658,7 @@ pointing to the same element. Consequently iterators and references that
 referred to one vector now refer to the other, and vice-versa.
 
 
Proposed resolution:

-
Add a new paragraph after 23.2.4.2  [lib.vector.capacity] paragraph 5:

+
Add a new paragraph after 23.2.4.2  [lib.vector.capacity] paragraph 5:

 

 
  void swap(vector<T,Allocator>& x);
 

@@ -10676,16 +10678,16 @@ do pointer twiddling, and that it should exchange all properties of
 the two vectors, including their reallocation guarantees.
 

 

-
345. type tm in <cwchar>
Section: 21.4  [lib.c.strings]  Status: WP  Submitter: Clark Nelson  Date: 19 Oct 2001

+
345. type tm in <cwchar>
Section: 21.4  [lib.c.strings]  Status: WP  Submitter: Clark Nelson  Date: 19 Oct 2001

 

 C99, and presumably amendment 1 to C90, specify that <wchar.h>
-declares struct tm as an incomplete type. However, table 48 in 21.4  [lib.c.strings] does not mention the type tm as being declared in
+declares struct tm as an incomplete type. However, table 48 in 21.4  [lib.c.strings] does not mention the type tm as being declared in
 <cwchar>. Is this omission intentional or accidental?
 

 
Proposed resolution:

-
In section 21.4  [lib.c.strings], add "tm" to table 48.

+
In section 21.4  [lib.c.strings], add "tm" to table 48.

 

-
346. Some iterator member functions should be const
Section: 24.1  [lib.iterator.requirements]  Status: WP  Submitter: Jeremy Siek  Date: 20 Oct 2001

+
346. Some iterator member functions should be const
Section: 24.1  [lib.iterator.requirements]  Status: WP  Submitter: Jeremy Siek  Date: 20 Oct 2001

 
Iterator member functions and operators that do not change the state
 of the iterator should be defined as const member functions or as
 functions that take iterators either by const reference or by
@@ -10697,7 +10699,7 @@ are suggested to make this explicit.

 for non-const and a,b for const iterators. The following changes
 make this more explicit and also fix a couple problems.

 
Proposed resolution:

-
In 24.1  [lib.iterator.requirements] Change the first section of p9 from
+
In 24.1  [lib.iterator.requirements] Change the first section of p9 from
 "In the following sections, a and b denote values of X..." to
 "In the following sections, a and b denote values of type const X...".

 
@@ -10725,11 +10727,11 @@ make this more explicit and also fix a couple problems.

 the same problem appears there.]

 
 

-
347. locale::category and bitmask requirements
Section: 22.1.1.1.1  [lib.locale.category]  Status: WP  Submitter: P.J. Plauger, Nathan Myers  Date: 23 Oct 2001

+
347. locale::category and bitmask requirements
Section: 22.1.1.1.1  [lib.locale.category]  Status: WP  Submitter: P.J. Plauger, Nathan Myers  Date: 23 Oct 2001

 

-In 22.1.1.1.1  [lib.locale.category] paragraph 1, the category members
+In 22.1.1.1.1  [lib.locale.category] paragraph 1, the category members
 are described as bitmask elements.  In fact, the bitmask requirements
-in 17.3.2.1.2  [lib.bitmask.types] don't seem quite right: none
+in 17.3.2.1.2  [lib.bitmask.types] don't seem quite right: none
 and all are bitmask constants, not bitmask elements.

 
 
In particular, the requirements for none interact poorly
@@ -10748,7 +10750,7 @@ re-expresses the status quo more clearly, without introducing any
 changes beyond resolving the DR.

 
 
Proposed resolution:

-
Replace the first two paragraphs of 22.1.1.1  [lib.locale.types] with:

+
Replace the first two paragraphs of 22.1.1.1  [lib.locale.types] with:

 

 
    typedef int category;
 

@@ -10792,7 +10794,7 @@ shown in Table 51:
 
 

 
Option 2: 

-Replace the first paragraph of 22.1.1.1  [lib.locale.types] with:

+Replace the first paragraph of 22.1.1.1  [lib.locale.types] with:

 

 

 Valid category values include the enumerated values.  In addition, the
@@ -10813,7 +10815,7 @@ of the other enumerated values; implementations may add extra categories.]
 

 

 

-
349. Minor typographical error in ostream_iterator
Section: 24.5.2  [lib.ostream.iterator]  Status: WP  Submitter: Andy Sawyer  Date: 24 Oct 2001

+
349. Minor typographical error in ostream_iterator
Section: 24.5.2  [lib.ostream.iterator]  Status: WP  Submitter: Andy Sawyer  Date: 24 Oct 2001

 
24.5.2 [lib.ostream.iterator] states:

 
    [...]
 
@@ -10826,11 +10828,11 @@ of the other enumerated values; implementations may add extra categories.]
 should be of type 'const charT*'.

 
Proposed resolution:

 

-In 24.5.2  [lib.ostream.iterator], replace const char* delim with
+In 24.5.2  [lib.ostream.iterator], replace const char* delim with
 const charT* delim.
 

 

-
352. missing fpos requirements
Section: 21.1.2  [lib.char.traits.typedefs]  Status: WP  Submitter: Martin Sebor  Date: 2 Dec 2001

+
352. missing fpos requirements
Section: 21.1.2  [lib.char.traits.typedefs]  Status: WP  Submitter: Martin Sebor  Date: 2 Dec 2001

 

 (1)
 There are no requirements on the stateT template parameter of
@@ -10873,7 +10875,7 @@ template fpos is used only in a very few places, all of which know the
 state type already.  Unless motivation is provided, the second should
 be considered NAD.

 

-
354. Associative container lower/upper bound requirements
Section: 23.1.2  [lib.associative.reqmts]  Status: WP  Submitter: Hans Aberg  Date: 17 Dec 2001

+
354. Associative container lower/upper bound requirements
Section: 23.1.2  [lib.associative.reqmts]  Status: WP  Submitter: Hans Aberg  Date: 17 Dec 2001

 

 Discussions in the thread "Associative container lower/upper bound
 requirements" on comp.std.c++ suggests that there is a defect in the
@@ -10907,7 +10909,7 @@ the intention (and not possible with the "const" versions).
 

 
Proposed resolution:

 
-
Change Table 69 of section 23.1.2  [lib.associative.reqmts] indicated entries
+
Change Table 69 of section 23.1.2  [lib.associative.reqmts] indicated entries
 to:

 
 

@@ -10925,7 +10927,7 @@ key greater than k, or a.end() if such an element is not found.
 
[Curaçao: LWG reviewed PR.]

 
 

-
355. Operational semantics for a.back()
Section: 23.1.1  [lib.sequence.reqmts]  Status: WP  Submitter: Yaroslav Mironov  Date: 23 Jan 2002

+
355. Operational semantics for a.back()
Section: 23.1.1  [lib.sequence.reqmts]  Status: WP  Submitter: Yaroslav Mironov  Date: 23 Jan 2002

 
 
Table 68 "Optional Sequence Operations" in 23.1.1/12
 specifies operational semantics for "a.back()" as
@@ -10995,7 +10997,7 @@ LWG would like a new issue opened.]

 
 

 
358. interpreting thousands_sep after a decimal_point
-
Section: 22.2.2.1.2  [lib.facet.num.get.virtuals]  Status: WP  Submitter: Martin Sebor  Date: 12 Mar 2002

+
Section: 22.2.2.1.2  [lib.facet.num.get.virtuals]  Status: WP  Submitter: Martin Sebor  Date: 12 Mar 2002

 

 I don't think thousands_sep is being treated correctly after
 decimal_point has been seen. Since grouping applies only to the
@@ -11041,7 +11043,7 @@ Change the first sentence of 22.2.2.1.2, p9 from
   support for such conventions, we need to do so explicitly.

 
 

-
359. num_put<>::do_put (..., bool) undocumented
Section: 22.2.2.2.1  [lib.facet.num.put.members]  Status: WP  Submitter: Martin Sebor  Date: 12 Mar 2002

+
359. num_put<>::do_put (..., bool) undocumented
Section: 22.2.2.2.1  [lib.facet.num.put.members]  Status: WP  Submitter: Martin Sebor  Date: 12 Mar 2002

 
22.2.2.2.1, p1:

 
     
    iter_type put (iter_type out, ios_base& str, char_type fill,
@@ -11087,11 +11089,11 @@ I think the least invasive change to fix it would be something like
 the following:
 

 
Proposed resolution:

-
In 22.2.2.2.2  [lib.facet.num.put.virtuals], just above paragraph 1, remove
+
In 22.2.2.2.2  [lib.facet.num.put.virtuals], just above paragraph 1, remove
   the bool overload.

 
 

-In 22.2.2.2.2  [lib.facet.num.put.virtuals], p23, make the following changes
+In 22.2.2.2.2  [lib.facet.num.put.virtuals], p23, make the following changes
 

 
 

@@ -11126,7 +11128,7 @@ This fixes a couple of obvious typos, and also fixes what appears to
 be a requirement of gratuitous inefficiency.
 

 

-
360. locale mandates inefficient implementation
Section: 22.1.1  [lib.locale]  Status: WP  Submitter: Martin Sebor  Date: 12 Mar 2002

+
360. locale mandates inefficient implementation
Section: 22.1.1  [lib.locale]  Status: WP  Submitter: Martin Sebor  Date: 12 Mar 2002

 

 22.1.1, p7 (copied below) allows iostream formatters and extractors
 to make assumptions about the values returned from facet members.
@@ -11162,7 +11164,7 @@ prevents locale from being implemented efficiently.
 
This change is reasonable becuase it clarifies the intent of this
   part of the standard.

 

-
363. Missing exception specification in 27.4.2.1.1
Section: 27.4.2.1.1  [lib.ios::failure]  Status: WP  Submitter: Walter Brown and Marc Paterno  Date: 20 May 2002

+
363. Missing exception specification in 27.4.2.1.1
Section: 27.4.2.1.1  [lib.ios::failure]  Status: WP  Submitter: Walter Brown and Marc Paterno  Date: 20 May 2002

 

 The destructor of ios_base::failure should have an empty throw
 specification, because the destructor of its base class, exception, is
@@ -11175,9 +11177,9 @@ declared in this way.
 
Rationale:

 
Fixes an obvious glitch.  This is almost editorial.

 

-
364. Inconsistent wording in 27.5.2.4.2
Section: 27.5.2.4.2  [lib.streambuf.virt.buffer]  Status: WP  Submitter: Walter Brown, Marc Paterno  Date: 10 May 2002

+
364. Inconsistent wording in 27.5.2.4.2
Section: 27.5.2.4.2  [lib.streambuf.virt.buffer]  Status: WP  Submitter: Walter Brown, Marc Paterno  Date: 10 May 2002

 

-27.5.2.4.2  [lib.streambuf.virt.buffer] paragraph 1 is inconsistent with the Effects
+27.5.2.4.2  [lib.streambuf.virt.buffer] paragraph 1 is inconsistent with the Effects
 clause for seekoff.
 

 
Proposed resolution:

@@ -11207,7 +11209,7 @@ for each class derived from basic_streambuf in this clause
   the existing wording and what's in the proposed resolution, but the
   change may make the intent clearer.

 

-
365. Lack of const-qualification in clause 27
Section: 27  [lib.input.output]  Status: WP  Submitter: Walter Brown, Marc Paterno  Date: 10 May 2002

+
365. Lack of const-qualification in clause 27
Section: 27  [lib.input.output]  Status: WP  Submitter: Walter Brown, Marc Paterno  Date: 10 May 2002

 

 Some stream and streambuf member functions are declared non-const,
 even thought they appear only to report information rather than to
@@ -11218,7 +11220,7 @@ document N1360 for details and rationale.
 
The list of member functions under discussion: in_avail,
 showmanyc, tellg, tellp, is_open.

 
-
Related issue: 73

+
Related issue: 73

 
 
Proposed resolution:

 
In 27.8.1.5, 27.8.1.7, 27.8.1.8, 27.8.1.10, 27.8.1.11, and 27.8.1.13

@@ -11231,7 +11233,7 @@ document N1360 for details and rationale.
 
Rationale:

 
Of the changes proposed in N1360, the only one that is safe is
 changing the filestreams' is_open to const.  The LWG believed that
-this was NAD the first time it considered this issue (issue 73), but now thinks otherwise.  The corresponding streambuf
+this was NAD the first time it considered this issue (issue 73), but now thinks otherwise.  The corresponding streambuf
 member function, after all,is already const.

 
 
The other proposed changes are less safe, because some streambuf
@@ -11246,8 +11248,8 @@ state exposed by the public interface is unchanged.

 way by providing both overloads; this would be a conforming extension.

 
 

-
370. Minor error in basic_istream::get
Section: 27.6.1.3  [lib.istream.unformatted]  Status: WP  Submitter: Ray Lischner  Date: 15 Jul 2002

-
Defect report for description of basic_istream::get (section 27.6.1.3  [lib.istream.unformatted]), paragraph 15. The description for the get function
+
370. Minor error in basic_istream::get
Section: 27.6.1.3  [lib.istream.unformatted]  Status: WP  Submitter: Ray Lischner  Date: 15 Jul 2002

+
Defect report for description of basic_istream::get (section 27.6.1.3  [lib.istream.unformatted]), paragraph 15. The description for the get function
 with the following signature:

 
 
  basic_istream<charT,traits>& get(basic_streambuf<char_type,traits>&
@@ -11277,26 +11279,26 @@ with the following signature:

 
Rationale:

 
Fixes an obvious typo.

 

-
373. Are basic_istream and basic_ostream to use (exceptions()&badbit) != 0 ?
Section: 27.6.1.2.1  [lib.istream.formatted.reqmts], 27.6.2.5.1  [lib.ostream.formatted.reqmts]  Status: WP  Submitter: Keith Baker  Date: 23 Jul 2002

+
373. Are basic_istream and basic_ostream to use (exceptions()&badbit) != 0 ?
Section: 27.6.1.2.1  [lib.istream.formatted.reqmts], 27.6.2.5.1  [lib.ostream.formatted.reqmts]  Status: WP  Submitter: Keith Baker  Date: 23 Jul 2002

 
 

-In 27.6.1.2.1  [lib.istream.formatted.reqmts] and 27.6.2.5.1  [lib.ostream.formatted.reqmts]
+In 27.6.1.2.1  [lib.istream.formatted.reqmts] and 27.6.2.5.1  [lib.ostream.formatted.reqmts]
 (exception()&badbit) != 0 is used in testing for rethrow, yet
-exception() is the constructor to class std::exception in 18.6.1  [lib.exception] that has no return type. Should member function
-exceptions() found in 27.4.4  [lib.ios] be used instead?
+exception() is the constructor to class std::exception in 18.6.1  [lib.exception] that has no return type. Should member function
+exceptions() found in 27.4.4  [lib.ios] be used instead?
 

 
 
Proposed resolution:

 

-In 27.6.1.2.1  [lib.istream.formatted.reqmts] and 27.6.2.5.1  [lib.ostream.formatted.reqmts], change
+In 27.6.1.2.1  [lib.istream.formatted.reqmts] and 27.6.2.5.1  [lib.ostream.formatted.reqmts], change
 "(exception()&badbit) != 0" to "(exceptions()&badbit) != 0".
 

 
Rationale:

 
Fixes an obvious typo.

 

-
375. basic_ios should be ios_base in 27.7.1.3
Section: 27.7.1.3  [lib.stringbuf.virtuals]  Status: WP  Submitter: Ray Lischner  Date: 14 Aug 2002

+
375. basic_ios should be ios_base in 27.7.1.3
Section: 27.7.1.3  [lib.stringbuf.virtuals]  Status: WP  Submitter: Ray Lischner  Date: 14 Aug 2002

 

-In Section 27.7.1.3  [lib.stringbuf.virtuals]: Table 90, Table 91, and paragraph
+In Section 27.7.1.3  [lib.stringbuf.virtuals]: Table 90, Table 91, and paragraph
 14 all contain references to "basic_ios::" which should be
 "ios_base::".
 

@@ -11308,7 +11310,7 @@ paragraph 14 to "ios_base".
 
Rationale:

 
Fixes an obvious typo.

 

-
379. nonsensical ctype::do_widen() requirement
Section: 22.2.1.1.2  [lib.locale.ctype.virtuals]  Status: WP  Submitter: Martin Sebor  Date: 6 Sep 2002

+
379. nonsensical ctype::do_widen() requirement
Section: 22.2.1.1.2  [lib.locale.ctype.virtuals]  Status: WP  Submitter: Martin Sebor  Date: 6 Sep 2002

 

 The last sentence in 22.2.1.1.2, p11 below doesn't seem to make sense.
 

@@ -11336,7 +11338,7 @@ footnote 224.)
 

 
Proposed resolution:

 

-Replace the last sentence of 22.2.1.1.2  [lib.locale.ctype.virtuals], p11 with the
+Replace the last sentence of 22.2.1.1.2  [lib.locale.ctype.virtuals], p11 with the
 following text:
 

 
       For any named ctype category with a ctype<char> facet ctc
@@ -11349,9 +11351,9 @@ following text:
 
Rationale:

 
The LWG believes this is just a typo, and that this is the correct fix.

 

-
380. typos in codecvt tables 53 and 54
Section: 22.2.1.5.2  [lib.locale.codecvt.virtuals]  Status: WP  Submitter: Martin Sebor  Date: 6 Sep 2002

+
380. typos in codecvt tables 53 and 54
Section: 22.2.1.5.2  [lib.locale.codecvt.virtuals]  Status: WP  Submitter: Martin Sebor  Date: 6 Sep 2002

 

-Tables 53 and 54 in 22.2.1.5.2  [lib.locale.codecvt.virtuals] are both titled "convert
+Tables 53 and 54 in 22.2.1.5.2  [lib.locale.codecvt.virtuals] are both titled "convert
 result values," when surely "do_in/do_out result values" must have
 been intended for Table 53 and "do_unshift result values" for Table
 54.
@@ -11376,7 +11378,7 @@ heading Meaning, to "space for more than (to_limit - to) destination
 elements was needed to terminate a sequence given the value of state."
 

 

-
381. detection of invalid mbstate_t in codecvt
Section: 22.2.1.5.2  [lib.locale.codecvt.virtuals]  Status: WP  Submitter: Martin Sebor  Date: 6 Sep 2002

+
381. detection of invalid mbstate_t in codecvt
Section: 22.2.1.5.2  [lib.locale.codecvt.virtuals]  Status: WP  Submitter: Martin Sebor  Date: 6 Sep 2002

 

 All but one codecvt member functions that take a state_type argument
 list as one of their preconditions that the state_type argument have
@@ -11426,7 +11428,7 @@ behavior.  Implementations that do choose to detect invalid state
 values, or that choose to detect any other kind of error, may return
 error as an indication.

 

-
383. Bidirectional iterator assertion typo
Section: 24.1.4  [lib.bidirectional.iterators]  Status: WP  Submitter: ysapir (submitted via comp.std.c++)  Date: 17 Oct 2002

+
383. Bidirectional iterator assertion typo
Section: 24.1.4  [lib.bidirectional.iterators]  Status: WP  Submitter: ysapir (submitted via comp.std.c++)  Date: 17 Oct 2002

 

 Following a discussion on the boost list regarding end iterators and
 the possibility of performing operator--() on them, it seems to me
@@ -11438,8 +11440,8 @@ with that discussion.
 I have checked this newsgroup, as well as attempted a search of the
 Active/Defect/Closed Issues List on the site for the words "s is
 derefer" so I believe this has not been proposed before.  Furthermore,
-the "Lists by Index" mentions only DR 299 on section
-24.1.4, and DR 299 is not related to this issue.
+the "Lists by Index" mentions only DR 299 on section
+24.1.4, and DR 299 is not related to this issue.
 

 
 

@@ -11483,7 +11485,7 @@ Change the guarantee to "postcondition: r is dereferenceable."
 
Rationale:

 
Fixes an obvious typo

 

-
389. Const overload of valarray::operator[] returns by value
Section: 26.3.2  [lib.template.valarray]  Status: WP  Submitter: Gabriel Dos Reis  Date: 8 Nov 2002

+
389. Const overload of valarray::operator[] returns by value
Section: 26.3.2  [lib.template.valarray]  Status: WP  Submitter: Gabriel Dos Reis  Date: 8 Nov 2002

 
Consider the following program:

 
    #include <iostream>
     #include <ostream>
@@ -11523,8 +11525,8 @@ integration within programs written in C++.  There is no reason why
 subscripting an expression of type valarray<T> that is const-qualified
 should not return a const T&.

 
Proposed resolution:

-
In the class synopsis in 26.3.2  [lib.template.valarray], and in
-26.3.2.3  [lib.valarray.access] just above paragraph 1, change

+
In the class synopsis in 26.3.2  [lib.template.valarray], and in
+26.3.2.3  [lib.valarray.access] just above paragraph 1, change

 
  T operator[](size_t const);
 

 
to

@@ -11541,28 +11543,28 @@ integrated with libraries in other languages, and return by value
 defeats that purpose.  It is believed that this change will have no
 impact on allowable optimizations.

 

-
391. non-member functions specified as const
Section: 22.1.3.2  [lib.conversions]  Status: WP  Submitter: James Kanze  Date: 10 Dec 2002

+
391. non-member functions specified as const
Section: 22.1.3.2  [lib.conversions]  Status: WP  Submitter: James Kanze  Date: 10 Dec 2002

 

 The specifications of toupper and tolower both specify the functions as
 const, althought they are not member functions, and are not specified as
-const in the header file synopsis in section 22.1  [lib.locales].
+const in the header file synopsis in section 22.1  [lib.locales].
 

 
Proposed resolution:

-
In 22.1.3.2  [lib.conversions], remove const from the function
+
In 22.1.3.2  [lib.conversions], remove const from the function
   declarations of std::toupper and std::tolower

 
Rationale:

 
Fixes an obvious typo

 

-
395. inconsistencies in the definitions of rand() and random_shuffle()
Section: 26.5  [lib.c.math]  Status: WP  Submitter: James Kanze  Date: 3 Jan 2003

+
395. inconsistencies in the definitions of rand() and random_shuffle()
Section: 26.5  [lib.c.math]  Status: WP  Submitter: James Kanze  Date: 3 Jan 2003

 

-In 26.5  [lib.c.math], the C++ standard refers to the C standard for the
+In 26.5  [lib.c.math], the C++ standard refers to the C standard for the
 definition of rand(); in the C standard, it is written that "The
 implementation shall behave as if no library function calls the rand
 function."
 

 
 

-In 25.2.11  [lib.alg.random.shuffle], there is no specification as to
+In 25.2.11  [lib.alg.random.shuffle], there is no specification as to
 how the two parameter version of the function generates its random
 value.  I believe that all current implementations in fact call rand()
 (in contradiction with the requirement avove); if an implementation does
@@ -11593,9 +11595,9 @@ implementation is permitted to use rand.]
   problem if the number of elements in the sequence is greater than
   RAND_MAX.
 
 

-
400. redundant type cast in lib.allocator.members
Section: 20.4.1.1  [lib.allocator.members]  Status: WP  Submitter: Markus Mauhart  Date: 27 Feb 2003

+
400. redundant type cast in lib.allocator.members
Section: 20.4.1.1  [lib.allocator.members]  Status: WP  Submitter: Markus Mauhart  Date: 27 Feb 2003

 

-20.4.1.1  [lib.allocator.members] allocator members, contains
+20.4.1.1  [lib.allocator.members] allocator members, contains
 the following 3 lines:
 

 
@@ -11615,16 +11617,16 @@ Replace "((T*) p)" with "p".
 
Rationale:

 
Just a typo, this is really editorial.

 

-
402. wrong new expression in [some_]allocator::construct
Section: 20.1.5  [lib.allocator.requirements], 20.4.1.1  [lib.allocator.members],   Status: WP  Submitter: Markus Mauhart  Date: 27 Feb 2003

+
402. wrong new expression in [some_]allocator::construct
Section: 20.1.5  [lib.allocator.requirements], 20.4.1.1  [lib.allocator.members],   Status: WP  Submitter: Markus Mauhart  Date: 27 Feb 2003

 

 This applies to the new expression that is contained in both par12 of
-20.4.1.1  [lib.allocator.members] and in par2 (table 32) of 20.1.5  [lib.allocator.requirements].
+20.4.1.1  [lib.allocator.members] and in par2 (table 32) of 20.1.5  [lib.allocator.requirements].
 I think this new expression is wrong, involving unintended side
 effects.
 

 
 
-
20.4.1.1  [lib.allocator.members]  contains the following 3 lines:

+
20.4.1.1  [lib.allocator.members]  contains the following 3 lines:

 
 
  11 Returns: the largest value N for which the call allocate(N,0) might succeed.
      void construct(pointer p, const_reference val);
@@ -11632,7 +11634,7 @@ effects.
 

 
 
-
20.1.5  [lib.allocator.requirements] in table 32 has the following line:

+
20.1.5  [lib.allocator.requirements] in table 32 has the following line:

 
  a.construct(p,t)   Effect: new((void*)p) T(t)
 

 
@@ -11667,34 +11669,34 @@ probably must think about it.
 Replace "new" with "::new" in both cases.
 

 

-
403. basic_string::swap should not throw exceptions
Section: 21.3.5.8  [lib.string::swap]  Status: WP  Submitter: Beman Dawes  Date: 25 Mar 2003

+
403. basic_string::swap should not throw exceptions
Section: 21.3.5.8  [lib.string::swap]  Status: WP  Submitter: Beman Dawes  Date: 25 Mar 2003

 
 

-std::basic_string, 21.3  [lib.basic.string] paragraph 2 says that
+std::basic_string, 21.3  [lib.basic.string] paragraph 2 says that
 basic_string "conforms to the requirements of a Sequence, as specified
 in (23.1.1)." The sequence requirements specified in (23.1.1) to not
 include any prohibition on swap members throwing exceptions.
 

 
 

-Section 23.1  [lib.container.requirements] paragraph 10 does limit conditions under
+Section 23.1  [lib.container.requirements] paragraph 10 does limit conditions under
 which exceptions may be thrown, but applies only to "all container
 types defined in this clause" and so excludes basic_string::swap
 because it is defined elsewhere.
 

 
 

-Eric Niebler points out that 21.3  [lib.basic.string] paragraph 5 explicitly
+Eric Niebler points out that 21.3  [lib.basic.string] paragraph 5 explicitly
 permits basic_string::swap to invalidates iterators, which is
-disallowed by 23.1  [lib.container.requirements] paragraph 10. Thus the standard would
+disallowed by 23.1  [lib.container.requirements] paragraph 10. Thus the standard would
 be contradictory if it were read or extended to read as having
-basic_string meet 23.1  [lib.container.requirements] paragraph 10 requirements.
+basic_string meet 23.1  [lib.container.requirements] paragraph 10 requirements.
 

 
 

 Yet several LWG members have expressed the belief that the original
 intent was that basic_string::swap should not throw exceptions as
-specified by 23.1  [lib.container.requirements] paragraph 10, and that the standard is
+specified by 23.1  [lib.container.requirements] paragraph 10, and that the standard is
 unclear on this issue. The complexity of basic_string::swap is
 specified as "constant time", indicating the intent was to avoid
 copying (which could cause a bad_alloc or other exception). An
@@ -11704,7 +11706,7 @@ exception-safe code.
 
 

 Note: There remains long standing concern over whether or not it is
-possible to reasonably meet the 23.1  [lib.container.requirements] paragraph 10 swap
+possible to reasonably meet the 23.1  [lib.container.requirements] paragraph 10 swap
 requirements when allocators are unequal. The specification of
 basic_string::swap exception requirements is in no way intended to
 address, prejudice, or otherwise impact that concern.
@@ -11716,14 +11718,14 @@ address, prejudice, or otherwise impact that concern.
 
 
Proposed resolution:

 

-In 21.3.5.8  [lib.string::swap], add a throws clause:
+In 21.3.5.8  [lib.string::swap], add a throws clause:
 

 
 

 Throws: Shall not throw exceptions.
 

 

-
404. May a replacement allocation function be declared inline?
Section: 17.4.3.4  [lib.replacement.functions], 18.4.1  [lib.new.delete]  Status: WP  Submitter: Matt Austern  Date: 24 Apr 2003

+
404. May a replacement allocation function be declared inline?
Section: 17.4.3.4  [lib.replacement.functions], 18.4.1  [lib.new.delete]  Status: WP  Submitter: Matt Austern  Date: 24 Apr 2003

 

 The eight basic dynamic memory allocation functions (single-object
 and array versions of ::operator new and ::operator delete, in the
@@ -11734,15 +11736,15 @@ in preference to the implementation's definition.
 
 

 Three different parts of the standard mention requirements on
-replacement functions: 17.4.3.4  [lib.replacement.functions], 18.4.1.1  [lib.new.delete.single]
-and 18.4.1.2  [lib.new.delete.array], and 3.7.3  [basic.stc.dynamic].
+replacement functions: 17.4.3.4  [lib.replacement.functions], 18.4.1.1  [lib.new.delete.single]
+and 18.4.1.2  [lib.new.delete.array], and 3.7.3  [basic.stc.dynamic].
 

 
 
None of these three places say whether a replacement function may
-  be declared inline.  18.4.1.1  [lib.new.delete.single] paragraph 2 specifies a
+  be declared inline.  18.4.1.1  [lib.new.delete.single] paragraph 2 specifies a
   signature for the replacement function, but that's not enough:
   the inline specifier is not part of a function's signature.
-  One might also reason from 7.1.2  [dcl.fct.spec] paragraph 2, which
+  One might also reason from 7.1.2  [dcl.fct.spec] paragraph 2, which
   requires that "an inline function shall be defined in every
   translation unit in which it is used," but this may not be quite
   specific enough either.  We should either explicitly allow or
@@ -11750,7 +11752,7 @@ and 18.4.1.2  [lib.replacement.functions] paragraph 3:
+Add a new sentence to the end of 17.4.3.4  [lib.replacement.functions] paragraph 3:
 "The program's definitions shall not be specified as inline.
 No diagnostic is required."
 

@@ -11766,16 +11768,16 @@ Providing this functionality would be difficult in some cases, and is
 believed to be of limited value.
 

 

-
405. qsort and POD
Section: 25.4  [lib.alg.c.library]  Status: DR  Submitter: Ray Lischner  Date: 08 Apr 2003

+
405. qsort and POD
Section: 25.4  [lib.alg.c.library]  Status: DR  Submitter: Ray Lischner  Date: 08 Apr 2003

 

-Section 25.4  [lib.alg.c.library] describes bsearch and qsort, from the C
+Section 25.4  [lib.alg.c.library] describes bsearch and qsort, from the C
 standard library. Paragraph 4 does not list any restrictions on qsort,
 but it should limit the base parameter to point to POD.  Presumably,
 qsort sorts the array by copying bytes, which requires POD.
 

 
Proposed resolution:

 

-In 25.4  [lib.alg.c.library] paragraph 4, just after the declarations and
+In 25.4  [lib.alg.c.library] paragraph 4, just after the declarations and
 before the nonnormative note, add these words: "both of which have the
 same behavior as the original declaration.  The behavior is undefined
 unless the objects in the array pointed to by base are of POD
@@ -11785,9 +11787,9 @@ type."
 
[Something along these lines is clearly necessary.  Matt
   provided wording.]

 

-
407. Can singular iterators be destroyed?
Section: 24.1  [lib.iterator.requirements]  Status: WP  Submitter: Nathan Myers  Date: 3 June 2003

+
407. Can singular iterators be destroyed?
Section: 24.1  [lib.iterator.requirements]  Status: WP  Submitter: Nathan Myers  Date: 3 June 2003

 

-Clause 24.1  [lib.iterator.requirements], paragraph 5, says that the only expression
+Clause 24.1  [lib.iterator.requirements], paragraph 5, says that the only expression
 that is defined for a singular iterator is "an assignment of a
 non-singular value to an iterator that holds a singular value".  This 
 means that destroying a singular iterator (e.g. letting an automatic
@@ -11801,16 +11803,16 @@ destroying an iterator that holds a singular value, or the assignment
 of a non-singular value to an iterator that holds a singular value."
 

 

-
410. Missing semantics for stack and queue comparison operators
Section: 23.2.3.1  [lib.queue], 23.2.3.3  [lib.stack]  Status: DR  Submitter: Hans Bos  Date: 7 Jun 2003

+
410. Missing semantics for stack and queue comparison operators
Section: 23.2.3.1  [lib.queue], 23.2.3.3  [lib.stack]  Status: DR  Submitter: Hans Bos  Date: 7 Jun 2003

 

-Sections 23.2.3.1  [lib.queue] and 23.2.3.3  [lib.stack] list
+Sections 23.2.3.1  [lib.queue] and 23.2.3.3  [lib.stack] list
 comparison operators (==, !=, <, <=, >, =>) for queue and
-stack.  Only the semantics for queue::operator== (23.2.3.1  [lib.queue] par2) and queue::operator< (23.2.3.1  [lib.queue]
+stack.  Only the semantics for queue::operator== (23.2.3.1  [lib.queue] par2) and queue::operator< (23.2.3.1  [lib.queue]
 par3) are defined.
 

 
Proposed resolution:

 
-
Add the following new paragraphs after 23.2.3.1  [lib.queue]
+
Add the following new paragraphs after 23.2.3.1  [lib.queue]
   paragraph 3:

 
 

@@ -11833,7 +11835,7 @@ par3) are defined.
 
 

 
-
Add the following paragraphs at the end of 23.2.3.3  [lib.stack]:

+
Add the following paragraphs at the end of 23.2.3.3  [lib.stack]:

 
 

 
@@ -11870,9 +11872,9 @@ par3) are defined.
 There isn't any real doubt about what these operators are
 supposed to do, but we ought to spell it out.
 

-
411. Wrong names of set member functions
Section: 25.3.5  [lib.alg.set.operations]  Status: WP  Submitter: Daniel Frey  Date: 9 Jul 2003

+
411. Wrong names of set member functions
Section: 25.3.5  [lib.alg.set.operations]  Status: WP  Submitter: Daniel Frey  Date: 9 Jul 2003

 

-25.3.5  [lib.alg.set.operations] paragraph 1 reads:
+25.3.5  [lib.alg.set.operations] paragraph 1 reads:
 "The semantics of the set operations are generalized to multisets in a 
 standard way by defining union() to contain the maximum number of 
 occurrences of every element, intersection() to contain the minimum, and 
@@ -11886,9 +11888,9 @@ set_intersection(), not union() and intersection().
 
Proposed resolution:

 
Change that sentence to use the correct names.

 

-
412. Typo in 27.4.4.3
Section: 27.4.4.3  [lib.iostate.flags]  Status: DR  Submitter: Martin Sebor  Date: 10 Jul 2003

+
412. Typo in 27.4.4.3
Section: 27.4.4.3  [lib.iostate.flags]  Status: DR  Submitter: Martin Sebor  Date: 10 Jul 2003

 

-The Effects clause in 27.4.4.3  [lib.iostate.flags] paragraph 5 says that the
+The Effects clause in 27.4.4.3  [lib.iostate.flags] paragraph 5 says that the
 function only throws if the respective bits are already set prior to
 the function call. That's obviously not the intent. The typo ought to
 be corrected and the text reworded as: "If (state &
@@ -11896,7 +11898,7 @@ exceptions()) == 0, returns. ..."
 

 
Proposed resolution:

 

-In 27.4.4.3  [lib.iostate.flags] paragraph 5, replace "If (rdstate() &
+In 27.4.4.3  [lib.iostate.flags] paragraph 5, replace "If (rdstate() &
 exceptions()) == 0" with "If ((state | (rdbuf() ? goodbit : badbit))
 & exceptions()) == 0".
 

@@ -11908,7 +11910,7 @@ exceptions()) == 0" with "If ((state | (rdbuf() ? goodbit : badbit))
   latter, of course. Post-Kona: Martin provided wording.]

 
 

-
414. Which iterators are invalidated by v.erase()?
Section: 23.2.4.3  [lib.vector.modifiers]  Status: WP  Submitter: Matt Austern  Date: 19 Aug 2003

+
414. Which iterators are invalidated by v.erase()?
Section: 23.2.4.3  [lib.vector.modifiers]  Status: WP  Submitter: Matt Austern  Date: 19 Aug 2003

 

 Consider the following code fragment:
 

@@ -11957,7 +11959,7 @@ techniques.)
 

 
Proposed resolution:

 

-In 23.2.4.3  [lib.vector.modifiers] paragraph 3, change "Invalidates all the
+In 23.2.4.3  [lib.vector.modifiers] paragraph 3, change "Invalidates all the
 iterators and references after the point of the erase" to
 "Invalidates iterators and references at or after the point of the
 erase". 
@@ -11969,7 +11971,7 @@ erase".
   and references in parallel, and it would seem counterintuitive to
   say that a reference to an erased value remains valid.

 

-
415. behavior of std::ws
Section: 27.6.1.4  [lib.istream.manip]  Status: DR  Submitter: Martin Sebor  Date: 18 Sep 2003

+
415. behavior of std::ws
Section: 27.6.1.4  [lib.istream.manip]  Status: DR  Submitter: Martin Sebor  Date: 18 Sep 2003

 

 According to 27.6.1.4, the ws() manipulator is not required to construct
 the sentry object. The manipulator is also not a member function so the
@@ -11982,7 +11984,7 @@ doesn't affect the stream's gcount).
 

 
Proposed resolution:

 

-Add to 27.6.1.4  [lib.istream.manip], immediately before the first sentence
+Add to 27.6.1.4  [lib.istream.manip], immediately before the first sentence
 of paragraph 1, the following text:
 

 
@@ -11997,7 +11999,7 @@ of paragraph 1, the following text:
 
[Post-Kona: Martin provided wording]

 
 

-
420. is std::FILE a complete type?
Section: 27.8.1  [lib.fstreams]  Status: WP  Submitter: Martin Sebor  Date: 18 Sep 2003

+
420. is std::FILE a complete type?
Section: 27.8.1  [lib.fstreams]  Status: WP  Submitter: Martin Sebor  Date: 18 Sep 2003

 

 7.19.1, p2, of C99 requires that the FILE type only be declared in
 <stdio.h>.  None of the (implementation-defined) members of the
@@ -12010,14 +12012,14 @@ it really the intent that FILE be a complete type or is an implementation
 allowed to just declare it without providing a full definition?
 

 
Proposed resolution:

-
In the first sentence of 27.8.1  [lib.fstreams] paragraph 2, change
+
In the first sentence of 27.8.1  [lib.fstreams] paragraph 2, change
   "defined" to "declared".

 
Rationale:

 
We don't want to impose any restrictions beyond what the C standard
   already says. We don't want to make anything implementation defined,
   because that imposes new requirements in implementations.

 

-
425. return value of std::get_temporary_buffer
Section: 20.4.3  [lib.temporary.buffer]  Status: DR  Submitter: Martin Sebor  Date: 18 Sep 2003

+
425. return value of std::get_temporary_buffer
Section: 20.4.3  [lib.temporary.buffer]  Status: DR  Submitter: Martin Sebor  Date: 18 Sep 2003

 

 The standard is not clear about the requirements on the value returned from
 a call to get_temporary_buffer(0). In particular, it fails to specify whether
@@ -12027,12 +12029,12 @@ malloc). The standard also fails to mention what the required behavior
 is when the argument is less than 0.
 

 
Proposed resolution:

-
Change 20.4.3  [lib.temporary.buffer] paragraph 2 from "...or a pair of 0
+
Change 20.4.3  [lib.temporary.buffer] paragraph 2 from "...or a pair of 0
 values if no storage can be obtained" to "...or a pair of 0 values if
 no storage can be obtained or if n <= 0."

 
[Kona: Matt provided wording]

 

-
426. search_n(), fill_n(), and generate_n() with negative n
Section: 25.1.9  [lib.alg.search], 25.2.5  [lib.alg.fill], 25.2.6  [lib.alg.generate]  Status: DR  Submitter: Martin Sebor  Date: 18 Sep 2003

+
426. search_n(), fill_n(), and generate_n() with negative n
Section: 25.1.9  [lib.alg.search], 25.2.5  [lib.alg.fill], 25.2.6  [lib.alg.generate]  Status: DR  Submitter: Martin Sebor  Date: 18 Sep 2003

 

 The complexity requirements for these function templates are incorrect
 (or don't even make sense) for negative n:

@@ -12099,7 +12101,7 @@ or 0 otherwise) assignments.
   so).  The LWG considered and rejected the alternative of saying that
   negative numbers are undefined behavior.

 

-
428. string::erase(iterator) validity
Section: 21.3.5.5  [lib.string::erase]  Status: WP  Submitter: Martin Sebor  Date: 18 Sep 2003

+
428. string::erase(iterator) validity
Section: 21.3.5.5  [lib.string::erase]  Status: WP  Submitter: Martin Sebor  Date: 18 Sep 2003

 

 23.1.1, p3 along with Table 67 specify as a prerequisite for a.erase(q)
 that q must be a valid dereferenceable iterator into the sequence a.
@@ -12115,7 +12117,7 @@ This may be interepreted as a relaxation of the general requirement,
 which is most likely not the intent.
 

 
Proposed resolution:

-
Remove 21.3.5.5  [lib.string::erase] paragraph 5.

+
Remove 21.3.5.5  [lib.string::erase] paragraph 5.

 
Rationale:

 
The LWG considered two options: changing the string requirements to
   match the general container requirements, or just removing the
@@ -12123,7 +12125,7 @@ which is most likely not the intent.
   option, on the grounds that duplicating text always risks the
   possibility that it might be duplicated incorrectly.

 

-
432. stringbuf::overflow() makes only one write position available
Section: 27.7.1.3  [lib.stringbuf.virtuals]  Status: DR  Submitter: Christian W Brock  Date: 24 Sep 2003

+
432. stringbuf::overflow() makes only one write position available
Section: 27.7.1.3  [lib.stringbuf.virtuals]  Status: DR  Submitter: Christian W Brock  Date: 24 Sep 2003

 
27.7.1.3 par 8 says:

 

 Notes: The function can make a write position available only if
@@ -12338,7 +12340,7 @@ newoff + off to the next pointer xnext .
 

 

 -12- _ If (newoff + off) < 0, or if (newoff + off) refers to an
-uninitialized character (as defined in 27.7.1.2  [lib.stringbuf.members]
+uninitialized character (as defined in 27.7.1.2  [lib.stringbuf.members]
 paragraph 1), the positioning operation fails. Otherwise, the function
 assigns xbeg + newoff + off to the next pointer xnext .
 

@@ -12394,7 +12396,7 @@ longer allowable since [pbase(), epptr()) may now contain
 uninitialized characters.  Positioning is only allowable over the
 initialized range.

 

-
435. bug in DR 25
Section: 21.3.7.9  [lib.string.io]  Status: DR  Submitter: Martin Sebor  Date: 15 Oct 2003

+
435. bug in DR 25
Section: 21.3.7.9  [lib.string.io]  Status: DR  Submitter: Martin Sebor  Date: 15 Oct 2003

 
 

 It has been pointed out that the proposed resolution in DR 25 may not be
@@ -12444,7 +12446,7 @@ iostreams where the operator does truncate).
   Benjamin provided wording.]

 
 

-
436. are cv-qualified facet types valid facets?
Section: 22.1.1.1.2  [lib.locale.facet]  Status: WP  Submitter: Martin Sebor  Date: 15 Oct 2003

+
436. are cv-qualified facet types valid facets?
Section: 22.1.1.1.2  [lib.locale.facet]  Status: WP  Submitter: Martin Sebor  Date: 15 Oct 2003

 

 Is "const std::ctype<char>" a valid template argument to has_facet, use_facet,
 and the locale template ctor? And if so, does it designate the same Facet as
@@ -12467,33 +12469,33 @@ template parameter.

 text.]

 
 

-
441. Is fpos::state const?
Section: 27.4.3  [lib.fpos]  Status: DR  Submitter: Vincent Leloup  Date: 17 Nov 2003

+
441. Is fpos::state const?
Section: 27.4.3  [lib.fpos]  Status: DR  Submitter: Vincent Leloup  Date: 17 Nov 2003

 

-In section 27.4.3.1  [lib.fpos.members] fpos<stateT>::state() is declared
-non const, but in section 27.4.3  [lib.fpos] it is declared const.
+In section 27.4.3.1  [lib.fpos.members] fpos<stateT>::state() is declared
+non const, but in section 27.4.3  [lib.fpos] it is declared const.
 

 
Proposed resolution:

 

-In section 27.4.3.1  [lib.fpos.members], change the declaration of 
+In section 27.4.3.1  [lib.fpos.members], change the declaration of 
 fpos<stateT>::state() to const.
 

 

-
442. sentry::operator bool() inconsistent signature
Section: 27.6.2.3  [lib.ostream::sentry]  Status: DR  Submitter: Vincent Leloup  Date: 18 Nov 2003

+
442. sentry::operator bool() inconsistent signature
Section: 27.6.2.3  [lib.ostream::sentry]  Status: DR  Submitter: Vincent Leloup  Date: 18 Nov 2003

 

-In section 27.6.2.3  [lib.ostream::sentry] paragraph 4, in description part
+In section 27.6.2.3  [lib.ostream::sentry] paragraph 4, in description part
 basic_ostream<charT, traits>::sentry::operator bool() is declared
 as non const, but in section 27.6.2.3, in synopsis it is declared
 const.
 

 
Proposed resolution:

 

-In section 27.6.2.3  [lib.ostream::sentry] paragraph 4, change the declaration
+In section 27.6.2.3  [lib.ostream::sentry] paragraph 4, change the declaration
 of sentry::operator bool() to const.
 

 

-
443. filebuf::close() inconsistent use of EOF
Section: 27.8.1.3  [lib.filebuf.members]  Status: DR  Submitter: Vincent Leloup  Date: 20 Nov 2003

+
443. filebuf::close() inconsistent use of EOF
Section: 27.8.1.3  [lib.filebuf.members]  Status: DR  Submitter: Vincent Leloup  Date: 20 Nov 2003

 

-In section 27.8.1.3  [lib.filebuf.members] par6, in effects description of
+In section 27.8.1.3  [lib.filebuf.members] par6, in effects description of
 basic_filebuf<charT, traits>::close(), overflow(EOF) is used twice;
 should be overflow(traits::eof()).
 

@@ -12502,7 +12504,7 @@ should be overflow(traits::eof()).
 Change overflow(EOF) to overflow(traits::eof()).
 

 

-
448. Random Access Iterators over abstract classes
Section: 24.1.5  [lib.random.access.iterators]  Status: DR  Submitter: Dave Abrahams  Date: 7 Jan 2004

+
448. Random Access Iterators over abstract classes
Section: 24.1.5  [lib.random.access.iterators]  Status: DR  Submitter: Dave Abrahams  Date: 7 Jan 2004

 

 Table 76, the random access iterator requirement table, says that the
 return type of a[n] must be "convertible to T".  When an iterator's
@@ -12514,7 +12516,7 @@ Surely this isn't an intended restriction?
 Change the return type to "convertible to T const&".
 

 

-
449. Library Issue 306 Goes Too Far
Section: 18.1  [lib.support.types]  Status: DR  Submitter: Pete Becker  Date: 15 Jan 2004

+
449. Library Issue 306 Goes Too Far
Section: 18.1  [lib.support.types]  Status: DR  Submitter: Pete Becker  Date: 15 Jan 2004

 
Original text:

 

 The macro offsetof accepts a restricted set of type arguments in this