Issue |
Status |
Section |
Title |
Proposed Resolution |
Priority |
Duplicates |
1173 |
Open |
17 [library] |
"Equivalence" wishy-washiness |
No |
3 |
|
877 |
LEWG |
17 [library] |
to throw() or to Throw: Nothing. |
Yes |
|
|
2392 |
New |
17.3.17 [defns.ntcts] |
"character type" is used but not defined |
No |
3 |
|
2136 |
Open |
17.5.1 [structure] |
Postconditions vs. exceptions |
No |
3 |
|
2710 |
Tentatively Ready |
17.5.1.4 [structure.specifications] |
"Effects: Equivalent to ..." doesn't count "Synchronization:" as determined semantics |
Yes |
0 |
|
2679 |
New |
17.5.1.4 [structure.specifications] |
Inconsistent Use of Effects and Equivalent To |
Yes |
3 |
|
2292 |
New |
17.5.1.4 [structure.specifications] |
Find a better phrasing for "shall not participate in overload resolution" |
No |
3 |
|
2692 |
Tentatively NAD |
17.5.2.1.3 [bitmask.types] |
Overspecification of lvalueness of bitmask elements |
No |
3 |
|
2146 |
Open |
17.6.3.1 [utility.arg.requirements] |
Are reference types Copy/Move-Constructible/Assignable or Destructible? |
No |
2 |
|
2152 |
Open |
17.6.3.2 [swappable.requirements] |
Instances of standard container types are not swappable |
No |
2 |
|
2114 |
Open |
17.6.3.3 [nullablepointer.requirements] |
Incorrect "contextually convertible to bool" requirements |
Yes |
3 |
|
2593 |
New |
17.6.3.5 [allocator.requirements] |
Moved-from state of Allocators |
Yes |
4 |
|
2461 |
New |
17.6.3.5 [allocator.requirements] |
Interaction between allocators and container exception safety guarantees |
No |
3 |
|
2178 |
Open |
17.6.3.5 [allocator.requirements] |
Allocator requirement changes not mentioned Annex C |
No |
3 |
|
2260 |
Open |
17.6.3.5 [allocator.requirements] |
Missing requirement for Allocator::pointer |
No |
3 |
|
2139 |
Open |
17.6.4.2.1 [namespace.std] |
What is a user-defined type? |
Yes |
4 |
|
2468 |
Open |
17.6.4.9 [res.on.arguments] |
Self-move-assignment of library types |
No |
2 |
|
2563 |
New |
17.6.5.5 [member.functions] |
LWG 2259 relaxes requirements, perhaps unintentionally |
No |
2 |
|
2695 |
New |
17.6.5.5 [member.functions] |
"As if" unclear in [member.functions] |
No |
3 |
|
2414 |
Open |
17.6.5.8 [reentrancy] |
Member function reentrancy should be implementation-defined |
Yes |
3 |
|
Issue |
Status |
Section |
Title |
Proposed Resolution |
Priority |
Duplicates |
1289 |
LEWG |
20.2 [utility] |
Generic casting requirements for smart pointers |
Yes |
|
|
2153 |
Open |
20.2.2 [utility.swap] |
Narrowing of the non-member swap contract |
No |
2 |
|
2599 |
New |
20.2.6 [declval] |
Library incomplete type permission phrase is unclear |
No |
3 |
|
2289 |
Open |
20.3.2 [pairs.pair] |
constexpr guarantees of defaulted functions still insufficient |
Yes |
3 |
|
2446 |
LEWG |
20.4.1 [tuple.general] |
Unspecialized std::tuple_size should be defined |
Yes |
|
|
2528 |
New |
20.4.2.1 [tuple.cnstr] |
Order of std::tuple construction unspecified |
No |
3 |
|
2312 |
Open |
20.4.2.1 [tuple.cnstr] |
tuple's constructor constraints need to be phrased more precisely |
Yes |
2 |
|
2419 |
LEWG |
20.4.2.1 [tuple.cnstr] |
Clang's libc++ extension to std::tuple |
No |
|
|
1201 |
LEWG |
20.4.2.4 [tuple.creation] |
Do we always want to unwrap ref-wrappers in make_tuple |
Yes |
|
|
2472 |
New |
20.4.2.8 [tuple.rel] |
Heterogeneous comparisons in the standard library can result in ambiguities |
No |
3 |
|
532 |
LEWG |
20.4.2.8 [tuple.rel] |
Tuple comparison |
Yes |
|
348 |
2348 |
Open |
20.8 [template.bitset] |
charT('1') is not the wide equivalent of '1' |
Yes |
3 |
|
1112 |
LEWG |
20.8 [template.bitset] |
bitsets and new style for loop |
Yes |
|
|
2421 |
New |
20.9.5 [ptr.align] |
Non-specification of handling zero size in std::align [ptr.align] |
No |
3 |
|
2089 |
EWG |
20.9.9.1 [allocator.members] |
std::allocator::construct should use uniform initialization |
Yes |
2 |
|
2598 |
New |
20.9.12.1 [specialized.addressof] |
addressof works on temporaries |
Yes |
3 |
|
2262 |
Open |
20.10.1.2 [unique.ptr.single] |
Requirement for unique_ptr<T>::get_deleter()(p) to be able to destroy the unique_ptr |
Yes |
3 |
|
933 |
LEWG |
20.10.1.2.5 [unique.ptr.single.modifiers] |
Unique_ptr defect |
No |
|
|
2594 |
New |
20.10.2.2 [util.smartptr.shared] |
Contradicting definition of empty shared_ptr on shared_ptr(nullptr, d) |
Yes |
3 |
|
1031 |
LEWG |
20.10.2.2 [util.smartptr.shared] |
Need shared_ptr conversion to a unique_ptr |
No |
|
|
1406 |
LEWG |
20.10.2.2 [util.smartptr.shared] |
Support hashing smart-pointers based on owner |
Yes |
|
|
2685 |
Tentatively Ready |
20.10.2.2.1 [util.smartptr.shared.const] |
shared_ptr deleters must not not throw on move construction |
Yes |
0 |
|
2337 |
Tentatively NAD |
20.10.2.2.5 [util.smartptr.shared.obs] |
shared_ptr operator*() should not be noexcept |
No |
2 |
|
2696 |
New |
20.10.2.2.6 [util.smartptr.shared.create] |
Interaction between make_shared and enable_shared_from_this is underspecified |
Yes |
2 |
|
2070 |
Open |
20.10.2.2.6 [util.smartptr.shared.create] |
allocate_shared should use allocator_traits<A>::construct |
Yes |
2 |
|
2179 |
Tentatively Resolved |
20.10.2.5 [util.smartptr.enab] |
enable_shared_from_this and construction from raw pointers |
No |
3 |
|
2529 |
Tentatively Resolved |
20.10.2.5 [util.smartptr.enab] |
Assigning to enable_shared_from_this::__weak_this twice |
No |
3 |
|
2445 |
SG1 |
20.10.2.6 [util.smartptr.shared.atomic] |
"Stronger" memory ordering |
No |
|
|
2700 |
New |
20.11 [memory.resource] |
resource_adaptor went missing |
Yes |
1 |
|
2701 |
New |
20.11.2.2 [memory.resource.prot] |
Unclear requirement in [memory.resource.prot] |
Yes |
3 |
|
2690 |
LEWG |
20.12.3 [func.invoke] |
invoke<R> |
Yes |
|
|
2562 |
New |
20.12.6 [comparisons] |
Consistent total ordering of pointers by comparison functors |
Yes |
3 |
|
2547 |
New |
20.12.6 [comparisons] |
Container requirements (and other library text) should say "strict total order", not just "total order" |
No |
3 |
|
2491 |
New |
20.12.6 [comparisons] |
std::less<T*> in constant expression |
No |
3 |
|
2501 |
New |
20.12.12.2 [func.wrap.func] |
std::function requires POCMA/POCCA |
No |
3 |
|
2502 |
New |
20.12.12.2 [func.wrap.func] |
std::function does not use allocator::construct |
No |
3 |
|
2062 |
Open |
20.12.12.2 [func.wrap.func] |
Effect contradictions w/o no-throw guarantee of std::function swaps |
No |
2 |
|
2370 |
Open |
20.12.12.2 [func.wrap.func] |
Operations involving type-erased allocators should not be noexcept in std::function |
Yes |
3 |
|
2591 |
New |
20.12.12.2.5 [func.wrap.func.targ] |
std::function's member template target() should not lead to undefined behaviour |
Yes |
3 |
|
2543 |
Open |
20.12.14 [unord.hash] |
LWG 2148 (hash support for enum types) seems under-specified |
Yes |
2 |
|
1025 |
LEWG |
20.12.14 [unord.hash] |
The library should provide more specializations for std::hash |
No |
|
|
1317 |
LEWG |
20.12.14 [unord.hash] |
make_hash |
Yes |
|
|
2290 |
Open |
20.13 [meta] |
Top-level "SFINAE"-based constraints should get a separate definition in Clause 17 |
Yes |
3 |
|
1120 |
LEWG |
20.13 [meta] |
New type trait - remove_all |
No |
|
|
2040 |
LEWG |
20.13 [meta] |
Missing type traits related to is_convertible |
Yes |
|
|
2452 |
Core |
20.13 [meta] |
is_constructible, etc. and default arguments |
No |
3 |
|
2514 |
New |
20.13.1 [meta.rqmts] |
Type traits must not be final |
No |
3 |
|
2358 |
New |
20.13.4.3 [meta.unary.prop] |
Apparently-bogus definition of is_empty type trait |
No |
3 |
|
2496 |
New |
20.13.4.3 [meta.unary.prop] |
Certain hard-to-avoid errors not in the immediate context are not allowed to be triggered by
the evaluation of type traits |
No |
3 |
|
2077 |
Open |
20.13.4.3 [meta.unary.prop] |
Further incomplete constraints for type traits |
No |
3 |
|
2116 |
Open |
20.13.4.3 [meta.unary.prop] |
std::swap noexcept(what?) |
No |
3 |
|
2460 |
New |
20.13.7.6 [meta.trans.other] |
LWG issue 2408 and value categories |
No |
2 |
|
2465 |
New |
20.13.7.6 [meta.trans.other] |
SFINAE-friendly common_type is nearly impossible to specialize
correctly and regresses key functionality |
No |
2 |
|
2567 |
New |
20.13.8 [meta.logical] |
Specification of logical operator traits uses BaseCharacteristic, which is defined only for UnaryTypeTraits
and BinaryTypeTraits |
No |
2 |
|
2569 |
New |
20.13.8 [meta.logical] |
conjunction and disjunction requirements are too strict |
No |
2 |
|
2587 |
New |
20.13.8 [meta.logical] |
"Convertible to bool" requirement in conjunction and disjunction |
No |
3 |
|
1121 |
LEWG |
20.14.4 [ratio.arithmetic] |
Support for multiple arguments |
Yes |
|
|
2592 |
New |
20.15.2 [time.syn] |
Require that chrono::duration_casts from smaller durations to larger durations do not overflow |
Yes |
4 |
|
2383 |
Open |
20.15.5.8 [time.duration.literals] |
Overflow cannot be ill-formed for chrono::duration integer literals |
No |
3 |
|
935 |
LEWG |
20.15.7 [time.clock] |
clock error handling needs to be specified |
Yes |
|
|
2717 |
New |
20.16.4 [allocator.adaptor.members] |
scoped_allocator_adaptor uses forward to do move's job |
Yes |
|
|
2511 |
New |
20.16.4 [allocator.adaptor.members] |
scoped_allocator_adaptor piecewise construction does not require CopyConstructible |
No |
3 |
|
Issue |
Status |
Section |
Title |
Proposed Resolution |
Priority |
Duplicates |
708 |
LEWG |
22 [localization] |
Locales need to be per thread and updated for POSIX changes |
No |
|
|
2694 |
New |
22.3.1.1.2 [locale.facet] |
Application of LWG 436 accidentally deleted definition of "facet" |
Yes |
3 |
|
2295 |
New |
22.3.1.2 [locale.cons] |
Locale name when the provided Facet is a nullptr |
No |
3 |
|
2394 |
New |
22.3.1.3 [locale.members] |
locale::name specification unclear — what is implementation-defined? |
No |
3 |
|
2478 |
New |
22.3.3.2.2 [conversions.string] |
Unclear how wstring_convert uses cvtstate |
No |
4 |
|
2481 |
New |
22.3.3.2.2 [conversions.string] |
wstring_convert should be more precise regarding "byte-error string" etc. |
No |
4 |
|
2226 |
LEWG |
22.3.3.2.2 [conversions.string] |
wstring_convert methods do not take allocator instance |
Yes |
|
|
2479 |
New |
22.3.3.2.3 [conversions.buffer] |
Unclear how wbuffer_convert uses cvtstate |
No |
4 |
|
2480 |
New |
22.3.3.2.3 [conversions.buffer] |
Error handling of wbuffer_convert unclear |
No |
4 |
|
2381 |
New |
22.4.2.1.2 [facet.num.get.virtuals] |
Inconsistency in parsing floating point numbers |
No |
2 |
|
2702 |
New |
22.4.2.2.2 [facet.num.put.virtuals] |
num_put::do_put(..., bool) performs ill-formed do_put call |
No |
3 |
|
2703 |
New |
22.4.2.2.2 [facet.num.put.virtuals] |
No provision for fill-padding when boolalpha is set |
No |
3 |
|
2117 |
Open |
22.4.2.2.2 [facet.num.put.virtuals] |
ios_base manipulators should have showgrouping/noshowgrouping |
No |
3 |
|
2512 |
New |
22.4.5.1.2 [locale.time.get.virtuals] |
Y2K bites; what is an "unambiguous year identifier"? |
No |
2 |
|
2691 |
New |
22.4.6.3 [locale.moneypunct] |
money_base::space and do_put: U+0020 versus fill |
Yes |
3 |
|
2507 |
New |
22.5 [locale.stdcvt] |
codecvt_mode should be a bitmask type |
No |
3 |
|
Issue |
Status |
Section |
Title |
Proposed Resolution |
Priority |
Duplicates |
2307 |
Open |
23 [containers] |
Should the Standard Library use explicit only when necessary? |
No |
2 |
|
1242 |
LEWG |
23 [containers] |
Enable SCARY iterators |
Yes |
|
|
760 |
Tentatively NAD |
23.2 [container.requirements] |
The emplace issue |
Yes |
2 |
|
2261 |
New |
23.2 [container.requirements] |
Are containers required to use their 'pointer' type internally? |
No |
2 |
|
2269 |
New |
23.2.1 [container.requirements.general] |
Container iterators and argument-dependent lookup |
No |
4 |
|
2321 |
Open |
23.2.1 [container.requirements.general] |
Moving containers should (usually) be required to preserve iterators |
Yes |
2 |
|
1521 |
LEWG |
23.2.1 [container.requirements.general] |
Requirements on internal pointer representations in containers |
Yes |
|
|
2698 |
Tentatively Ready |
23.2.3 [sequence.reqmts] |
Effect of assign() on iterators/pointers/references |
Yes |
0 |
|
2705 |
New |
23.2.3 [sequence.reqmts] |
Questionable precondition on Sequence containers a.assign(n, t) |
Yes |
3 |
|
2206 |
Open |
23.2.3 [sequence.reqmts] |
Inaccuracy in initializer_list constructor requirements |
No |
3 |
|
2362 |
New |
23.2.4 [associative.reqmts] |
unique, associative emplace() should not move/copy the mapped_type constructor
arguments when no insertion happens |
No |
3 |
|
2215 |
Open |
23.2.4 [associative.reqmts] |
(unordered) associative container functors should be CopyConstructible |
Yes |
3 |
|
2227 |
Open |
23.2.4 [associative.reqmts] |
Stateful comparison objects in associative containers |
Yes |
3 |
|
1041 |
LEWG |
23.2.4 [associative.reqmts] |
Add associative/unordered container functions that allow to extract elements |
Yes |
|
|
2430 |
LEWG |
23.2.4 [associative.reqmts] |
Heterogeneous container lookup should be enabled using meta-function instead of nested type |
No |
|
|
2540 |
New |
23.2.5 [unord.req] |
unordered_multimap::insert hint iterator |
Yes |
3 |
|
1175 |
Open |
23.2.5 [unord.req] |
unordered complexity |
Yes |
3 |
|
2198 |
Open |
23.2.5 [unord.req] |
max_load_factor(z) makes no strong guarantees, but bans useful behavior |
No |
3 |
|
2199 |
Open |
23.2.5 [unord.req] |
unordered containers are required to have an initial max load factor of 1.0 |
No |
3 |
|
1188 |
LEWG |
23.2.5 [unord.req] |
Unordered containers should have a minimum load factor as well as a maximum |
Yes |
|
|
2189 |
Open |
23.2.5.1 [unord.req.except] |
Throwing swap breaks unordered containers' state |
No |
3 |
|
2335 |
New |
23.3.7 [array] |
array<array<int, 3>, 4> should be layout-compatible with int[4][3] |
No |
3 |
|
851 |
LEWG |
23.3.7 [array] |
simplified array construction |
Yes |
|
|
2443 |
LEWG |
23.3.7 [array] |
std::array member functions should be constexpr |
No |
|
|
2157 |
Open |
23.3.7.8 [array.zero] |
How does std::array<T,0> initialization work when T is not default-constructible? |
Yes |
3 |
|
1184 |
LEWG |
23.3.11 [vector] |
Feature request: dynamic bitset |
No |
|
|
2158 |
New |
23.3.11.3 [vector.capacity] |
Conditional copy/move in std::vector |
No |
2 |
|
2223 |
Open |
23.3.11.3 [vector.capacity] |
shrink_to_fit effect on iterator validity |
Yes |
2 |
|
2596 |
Tentatively Ready |
23.3.11.4 [vector.data] |
vector::data() should use addressof |
Yes |
0 |
|
2256 |
New |
23.3.11.5 [vector.modifiers] |
On vector iterator invalidation |
No |
3 |
|
2449 |
New |
23.3.11.5 [vector.modifiers] |
vector::insert invalidates end()? |
No |
3 |
|
2164 |
Open |
23.3.11.5 [vector.modifiers] |
What are the semantics of vector.emplace(vector.begin(), vector.back())? |
No |
2 |
|
1422 |
LEWG |
23.3.12 [vector.bool] |
vector<bool> iterators are not random access |
No |
|
|
2161 |
New |
23.4 [associative] |
const equivalence of std::map |
No |
2 |
|
839 |
LEWG |
23.4 [associative] |
Maps and sets missing splice operation |
No |
|
|
2713 |
New |
23.5 [unord] |
More missing allocator-extended constructors for unordered containers |
Yes |
|
|
2684 |
Tentatively Ready |
23.6.5 [priority.queue] |
priority_queue lacking comparator typedef |
Yes |
0 |
|
Issue |
Status |
Section |
Title |
Proposed Resolution |
Priority |
Duplicates |
2578 |
New |
24.2 [iterator.requirements] |
Iterator requirements should reference iterator traits |
Yes |
3 |
|
1213 |
Open |
24.2 [iterator.requirements] |
Meaning of valid and singular iterator underspecified |
No |
4 |
|
2375 |
New |
24.2.1 [iterator.requirements.general] |
Is [iterator.requirements.general]/9 too broadly applied? |
No |
3 |
|
484 |
LEWG |
24.2.3 [input.iterators] |
Convertible to T |
No |
|
|
2035 |
Open |
24.2.4 [output.iterators] |
Output iterator requirements are broken |
Yes |
3 |
|
2038 |
Open |
24.2.4 [output.iterators] |
Missing definition for incrementable iterator |
No |
3 |
|
2519 |
New |
24.2.7 [random.access.iterators] |
Iterator operator-= has gratuitous undefined behaviour |
Yes |
2 |
|
1320 |
LEWG |
24.3 [iterator.synopsis] |
Header for iter_swap |
Yes |
|
|
2208 |
Tentatively Resolved |
24.5.1 [reverse.iterators] |
std::reverse_iterator should be a literal type |
Yes |
3 |
|
2595 |
New |
24.5.1.1 [reverse.iterator] |
reverse_iterator::operator[]'s return type revisited |
Yes |
3 |
|
1052 |
LEWG |
24.5.1.3.5 [reverse.iter.opref] |
reverse_iterator::operator-> should also support smart pointers |
Yes |
|
|
2366 |
New |
24.6.3 [istreambuf.iterator] |
istreambuf_iterator end-of-stream equality |
No |
3 |
|
2544 |
New |
24.6.3.2 [istreambuf.iterator.cons] |
istreambuf_iterator(basic_streambuf<charT, traits>* s) effects unclear when s is 0 |
Yes |
3 |
|
2457 |
New |
24.7 [iterator.range] |
std::begin() and std::end() do not support multi-dimensional arrays correctly |
No |
3 |
|
Issue |
Status |
Section |
Title |
Proposed Resolution |
Priority |
Duplicates |
2699 |
New |
26.3 [numeric.requirements] |
Missing restriction in [numeric.requirements] |
Yes |
3 |
|
2693 |
New |
26.5 [complex.numbers] |
constexpr for various std::complex arithmetic and value operators |
No |
3 |
|
1154 |
LEWG |
26.5 [complex.numbers] |
complex should accept integral types |
Yes |
|
|
1217 |
LEWG |
26.5 [complex.numbers] |
Quaternion support |
No |
|
|
2714 |
New |
26.5.6 [complex.ops] |
complex stream extraction underspecified |
Yes |
|
|
2597 |
New |
26.5.8 [complex.transcendentals] |
std::log misspecified for complex numbers |
No |
3 |
|
2154 |
New |
26.6.1.3 [rand.req.urng] |
What exactly does compile-time complexity imply? |
No |
4 |
|
2352 |
New |
26.6.7.1 [rand.util.seedseq] |
Is a default-constructed std::seed_seq intended to produce a predictable .generate()? |
No |
2 |
|
2524 |
Open |
26.6.8.4.2 [rand.dist.pois.exp] |
generate_canonical can occasionally return 1.0 |
No |
2 |
|
2423 |
New |
26.7.5 [template.slice.array] |
Missing specification slice_array, gslice_array, mask_array, indirect_array copy constructor |
Yes |
4 |
|
2115 |
Open |
26.7.8 [template.mask.array] |
Undefined behaviour for valarray assignments with mask_array index? |
No |
4 |
|
2055 |
LEWG |
26.8 [numeric.ops] |
std::move in std::accumulate and other algorithms |
No |
|
|
2687 |
New |
26.8.7 [exclusive.scan] |
{inclusive,exclusive}_scan misspecified |
Yes |
1 |
|
2294 |
Open |
26.9 [c.math] |
<cstdlib> should declare abs(double) |
Yes |
2 |
|
Issue |
Status |
Section |
Title |
Proposed Resolution |
Priority |
Duplicates |
423 |
LEWG |
27 [input.output] |
effects of negative streamsize in iostreams |
Yes |
|
|
2600 |
LEWG |
27.5.3.5 [ios.base.storage] |
ios_base must store inaccessible iostate flags |
No |
|
|
2675 |
New |
27.5.3.6 [ios.base.callback] |
register_callback can fail |
No |
3 |
|
2214 |
Open |
27.5.5.2 [basic.ios.cons] |
Clarify basic_ios::init call restrictions |
Yes |
4 |
|
2504 |
New |
27.6.3 [streambuf] |
basic_streambuf is not an abstract class |
No |
3 |
|
255 |
LEWG |
27.6.3 [streambuf] |
Why do basic_streambuf<>::pbump() and gbump() take an int? |
Yes |
|
|
2349 |
Open |
27.7.2.2.1 [istream.formatted.reqmts] |
Clarify input/output function rethrow behavior |
Yes |
3 |
|
2499 |
Open |
27.7.2.2.3 [istream::extractors] |
operator>>(basic_istream&, CharT*) makes it hard to avoid buffer overflows |
No |
2 |
|
2243 |
New |
27.7.2.3 [istream.unformatted] |
istream::putback problem |
No |
3 |
|
2498 |
New |
27.7.2.6 [istream.rvalue] |
operator>>(basic_istream&&, T&&) returns basic_istream&, but should probably return
basic_istream&& |
No |
3 |
|
2221 |
New |
27.7.3 [output.streams] |
No formatted output operator for nullptr |
No |
3 |
|
2342 |
New |
27.7.3.1 [ostream] |
User conversion to wchar_t const* or to wchar_t not invoked for operator<< |
Yes |
4 |
|
2497 |
New |
27.7.3.4 [ostream::sentry] |
Use of uncaught_exception() |
No |
3 |
|
2534 |
New |
27.7.3.9 [ostream.rvalue] |
Constrain rvalue stream operators |
Yes |
3 |
|
1203 |
LEWG |
27.7.3.9 [ostream.rvalue] |
More useful rvalue stream insertion |
Yes |
|
|
2286 |
New |
27.8.2.4 [stringbuf.virtuals] |
stringbuf::underflow() underspecified |
Yes |
4 |
|
2121 |
New |
27.8.5.1 [stringstream.cons] |
app for string streams |
No |
3 |
|
2676 |
New |
27.9 [file.streams] |
Provide filesystem::path overloads for File-based streams |
Yes |
2 |
|
1150 |
LEWG |
27.9.5 [fstream] |
wchar_t, char16_t and char32_t filenames |
No |
|
|
2680 |
New |
27.10 [filesystems] |
Add "Equivalent to" to filesystem |
Yes |
2 |
|
2707 |
Tentatively Ready |
27.10.8 [class.path] |
path construction and assignment should have "string_type&&" overloads |
Yes |
0 |
|
2668 |
New |
27.10.8 [class.path] |
path::operator+= is defined, but not operator+ |
Yes |
3 |
|
2711 |
New |
27.10.8.4.1 [path.construct] |
path is convertible from approximately everything under the sun |
Yes |
1 |
|
2664 |
New |
27.10.8.4.3 [path.append] |
operator / (and other append) semantics not useful if argument has root |
No |
2 |
|
2665 |
New |
27.10.8.4.5 [path.modifiers] |
remove_filename() post condition is incorrect |
Yes |
3 |
|
2674 |
Tentatively Ready |
27.10.8.5 [path.itr] |
Bidirectional iterator requirement on path::iterator
is very expensive |
Yes |
2 |
|
2678 |
New |
27.10.10.1 [enum.file_type] |
std::filesystem enum classes overspecified |
Yes |
3 |
|
2677 |
New |
27.10.12.3 [directory_entry.obs] |
directory_entry::status is not allowed to be
cached as a quality-of-implementation issue |
No |
2 |
|
2706 |
Tentatively Ready |
27.10.14 [class.rec.dir.itr] |
Error reporting for recursive_directory_iterator::pop() is under-specified |
Yes |
0 |
|
2704 |
New |
27.10.14.1 [rec.dir.itr.members] |
recursive_directory_iterator's members should require '*this is dereferenceable' |
Yes |
1 |
|
2708 |
New |
27.10.14.1 [rec.dir.itr.members] |
recursive_directory_iterator::recursion_pending() is incorrectly specified |
Yes |
2 |
|
2683 |
Tentatively Ready |
27.10.15.3 [fs.op.copy] |
filesystem::copy() says "no effects" |
Yes |
0 |
|
2681 |
New |
27.10.15.3 [fs.op.copy] |
filesystem::copy() cannot copy symlinks |
Yes |
2 |
|
2682 |
New |
27.10.15.3 [fs.op.copy] |
filesystem::copy() won't create a symlink to a directory |
Yes |
2 |
|
2712 |
New |
27.10.15.4 [fs.op.copy_file] |
copy_file(from, to, ...) has a number of unspecified error conditions |
No |
2 |
|
2663 |
New |
27.10.15.14 [fs.op.file_size] |
Enable efficient retrieval of file size from directory_entry |
Yes |
2 |
|
2672 |
New |
27.10.15.19 [fs.op.is_empty] |
Should is_empty use error_code in its specification? |
Yes |
3 |
|
2548 |
New |
27.11 [c.files] |
Missing vfscanf from <cstdio> |
Yes |
3 |
|
Issue |
Status |
Section |
Title |
Proposed Resolution |
Priority |
Duplicates |
2490 |
New |
28 [re] |
<regex> needs lots of noexcept |
No |
3 |
|
523 |
LEWG |
28 [re] |
regex case-insensitive character ranges are unimplementable as specified |
No |
|
|
2431 |
New |
28.3 [re.req] |
Missing regular expression traits requirements |
No |
3 |
|
2503 |
New |
28.5.1 [re.synopt] |
multiline option should be added to syntax_option_type |
Yes |
2 |
|
2331 |
Open |
28.5.1 [re.synopt] |
regex_constants::collate's effects are inaccurately summarized |
Yes |
3 |
|
2338 |
Open |
28.7 [re.traits] |
§[re.traits]/7 expects of locale facets something not guaranteed by [locale.facet]/4 |
Yes |
3 |
|
1396 |
LEWG |
28.8 [re.regex] |
regex should support allocators |
No |
|
1451 |
2137 |
Open |
28.8.3 [re.regex.assign] |
Misleadingly constrained post-condition in the presence of exceptions |
Yes |
3 |
|
2589 |
New |
28.10 [re.results] |
match_results can't satisfy the requirements of a container |
Yes |
3 |
|
2195 |
Open |
28.10 [re.results] |
Missing constructors for match_results |
Yes |
3 |
|
2183 |
New |
28.10.1 [re.results.const] |
Muddled allocator requirements for match_results constructors |
No |
3 |
|
2184 |
New |
28.10.1 [re.results.const] |
Muddled allocator requirements for match_results assignments |
No |
3 |
|
2191 |
New |
28.10.1 [re.results.const] |
Incorrect specification of match_results(match_results&&) |
No |
4 |
|
2216 |
New |
28.11.4 [re.alg.replace] |
regex_replace(basic_string) allocator handling |
No |
3 |
|
2220 |
New |
28.12.2.2 [re.tokiter.comp] |
Under-specification of operator== for regex_token_iterator |
No |
2 |
|
2584 |
New |
28.13 [re.grammar] |
<regex> ECMAScript IdentityEscape is ambiguous |
Yes |
2 |
|
2343 |
New |
28.13 [re.grammar] |
Is the value of the ECMA-262 RegExp object's multiline property really false? |
No |
2 |
|
2546 |
New |
28.13 [re.grammar] |
Implementability of locale-sensitive UnicodeEscapeSequence matching |
No |
4 |
|
Issue |
Status |
Section |
Title |
Proposed Resolution |
Priority |
Duplicates |
1484 |
LEWG |
30.3.1 [thread.thread.class] |
Need a way to join a thread with a timeout |
No |
|
|
1488 |
LEWG |
30.4 [thread.mutex] |
Improve interoperability between the C++0x and C1x threads APIs |
No |
|
|
936 |
LEWG |
30.4.1 [thread.mutex.requirements] |
Mutex type overspecified |
No |
|
961 |
961 |
LEWG |
30.4.1 [thread.mutex.requirements] |
Various threading bugs #11 |
No |
|
936 |
1493 |
LEWG |
30.4.1 [thread.mutex.requirements] |
Add mutex, recursive_mutex, is_locked function |
No |
|
|
2363 |
Open |
30.4.1.5.1 [thread.sharedtimedmutex.class] |
Defect in 30.4.1.4.1 [thread.sharedtimedmutex.class] |
Yes |
2 |
|
1499 |
LEWG |
30.5 [thread.condition] |
Condition variables preclude wakeup optimization |
No |
|
|
2530 |
New |
30.6.4 [futures.state] |
Clarify observable side effects of releasing a shared state |
No |
3 |
|
2532 |
New |
30.6.5 [futures.promise] |
Satisfying a promise at thread exit |
No |
3 |
|
2095 |
Open |
30.6.5 [futures.promise] |
promise and packaged_task missing constructors needed for uses-allocator construction |
Yes |
4 |
|
2412 |
SG1 |
30.6.5 [futures.promise] |
promise::set_value() and promise::get_future() should not race |
Yes |
|
|
2556 |
New |
30.6.6 [futures.unique_future] |
Wide contract for future::share() |
Yes |
3 |
|
2531 |
New |
30.6.6 [futures.unique_future] |
future::get should explicitly state that the shared state is released |
Yes |
3 |
|
2202 |
Deferred |
30.6.8 [futures.async] |
Missing allocator support by async |
No |
4 |
|
2245 |
Open |
30.6.9.1 [futures.task.members] |
packaged_task::reset() memory allocation |
No |
3 |
|