N1598=04-0038 previous version N1512=03-0095
February 14, 2004
Maintainers: Bjarne Stroustrup (bs@cs.tamu.edu) and David Vandevoorde (daveed@edg.com).
This is alist of issues constructed from topics of current topics in the evolution working group, reflector threads, and email messages received. We expect that the list will grow significantly and that the presentation and organization of this list will evolve to cope. Please note that suggestions only appear if there is a possible need for a core language change; pure library proposals belong in the libraries working group.
It is obvious to us that there are so many proposals for language extensions that most must be rejected in order to keep the language reasonably manageable and coherent.
We note the requests for an XML format, but haven't yet had a chance to do anything about that.
Naturally, we'd appreciate suggestions that we have forgotten and drafts for the various entries that are currently just placeholders.
We try to give each suggestion, issue, and proposal a reasonably mnemonic name in addition to its number. Where we know of an original source, we’ll try to identify it. In our experience, most ideas have multiple sources, so we encourage people not to be too proprietary about “their” suggestions.
We expect that suggestions, issues, and proposals will eventually be extensively cross referenced so that people can see which proposals are the responses to which suggestions and issues.
For proposals, we’ll record evolution group straw votes and committee votes, if any. If a suggestion, issue, or proposal has been discussed and didn’t have strong support, we mark it LOW to indicate that no further EWG discussion will occur without new input.
The expected “lifecycle” of a language extension idea is that it will emerge from several suggestions, merge into an issue, and emerge for vote as one or more proposals. In that process several papers will be written.
The EWG (Evolution Working Group) tries to classify suggestions, issues, and proposals according to which larger language concerns they address and to favor proposals that address
We expect that these directions will eventually become reasonably well specified and be explicitly approved by the committee. Currently, they are simply synthesized from committee and working group discussions.
Typically, a proposal will not go to full committee before CWG or LWG has discussed it either on a reflector or at a meeting.
We would like to minimize the size and number of core language extensions. Conseqently, for each proposal, we will consider if a standard library facility would be sufficient to solve the problem or if a combination of a small core language change plus a standard library extension would do the job.
Compatibility with C++03 and the zero-overhead principle are considered very important.
See ES001. Note by Stroustrup: c++std-ext-5364. Paper by Järvi, Gregor, Siek, and Stroustrup: N1478=03-0061.
See ES004 (typedef template). Note by Mat Marcus and Gabriel dos Reis: N1449/03-0032. Note by Gabriel dos Reis and Bjarne Stroustrup: N1489.
See EI001. Note by Stroustrup to be written.
Note by Mat Marcus and Gabriel dos Reis to be written.
Discussion managed by Pete Becker.
Paper by Anthony Williams: WG21/N1427-J16/03-0009. See ES043.
Paper by Howard Hinnant: N1377=02-0035.
Introduce the keyword nullptr to denote a value that can be assigned to any pointer, but not to non-pointers.
Paper by Herb Sutter and Bjarne Stroustrup: N1488.
Paper by Robert Klarer and John Maddock: N1381/02-0039 "Proposal to Add Static Assertions to the Core Language".
A mechanism for better specification of template arguments, leading to better error messages and selection of templates based on template argument types.
Note by Gabriel Dos Reis and Bjarne Stroustrup: Concepts - design choices for template argument checking. N1522=03-0105. Note by Bjarne Stroustrup: Concept checking - a more abstract complement to type checking. N1510. Note by Bjarne Strousrup and Gabriel Dos Reis: Concepts - syntax and composition. N1536.
See ES046.
A mechanism for initializing containers with initializer lists and for using initializer lists as function arguments.
Note by Gabriel Dos Reis and Bjarne Stroustrup: N1509. See also proposal for user-defined literals EP012. Alternative proposal by Daniel Gutson: N1493.
Note by Bjarne Stroustrup: N1511.
Macros can arbitrarily change the meaning of any piece of code. This imposes restrictive defensive naming practices and even then leads to surprises and errors. Namespaces provide no defense. Since macros are typically found in headers (incl. standard headers) a programmer cannot be expected to know every macro used in a program.
Macros are so widely used and some uses, such #include guards and conditional compilation control macros, have no generally acceptable alternatives.
See EP003. See ES042.
Too many simple things cannot be expressed simply and require error-prone workarounds. This discourages good style and complicates early teaching.
Paper by Francis Glassborow: WG21/N1445==J16/03-0027.
C++ doesn't have a standard GUI. This is widely considered to mean that C++ doesn's have a GUI and can't be used for applications requiring a grephical user interface. It also hampers eductaion by biasing teaching towards either proprietary extensions, limiting the utility of what is taught to a single library or vendor, or to command line exercises widely perceived as booring and old-fashioned.
GUIs are often built using language extensions - thus rendering them non-portable.
If we had typeof (or an equivalent) then an entire LWG proposal, Doug Gregor's result_of<> class, would become unnecessary. It would be nice to be able to write something like this:
template < template T1, template T2, template T3>
typeof(f(t1, t2, t3))
void foo(T1& t1, T2& t2, T3& t3) { return f(t1, t2, t3); }
Forwarded from LWG by Matt Austern. See EP001.
ES002. Solve the forwarding problem.
By "the forwarding problem" I mean: create a wrapper function f2 that forwards its arguments to a generic function f1 in exactly the same way as if f1 had been called directly. Not trivial, since some of f1's arguments may by of the form T, some T&, some const T&.
Forwarded from LWG by Matt Austern. See EI002.
The T&& stuff, disgusting as the syntax may be, would be a solution to the forwarding problem.
Forwarded from LWG by Matt Austern. See EP007.
There are half dozen places in the existing library where we could remove gratuitous ugliness if we had them, and at least as many in the TR proposals. See EP002 “template aliases”.
Forwarded from LWG by Matt Austern. See EP002.
Also: Herb Sutter: paper N1406/02-0064. Walter Brown paper: N1451/03-0034. Tread: c++std-ext-5658
Forwarded from LWG by Matt Austern.
The ability to overload new-style cases like static_cast and dynamic_cast. This is useful for smart pointers, and it would also be useful if we ever want to remove the gaps in allocator specification.
Forwarded from LWG by Matt Austern.
Forwarded from LWG by Matt Austern. See EP004.
(Meaning two things: make it possible to forward one overload of X::X to another overload, and make it possible to for a derived class to get constructors with the same signatures as its base has, without having to spell them out again.)
Forwarded from LWG by Matt Austern. See EI002.
One example is a simple way to write a compile-time test checking whether a generic class X defines a type called Foo. BS: This ought to relate to decltype (ES001). For example
decltype(T).has_member(Foo);
Forwarded from LWG by Matt Austern.
This would be useful for policy classes.
One might argue for named function parameters as well, just for consistency's sake, but there isn't as strong a demand for it.
Forwarded from LWG by Matt Austern.
Provide core language facilities, such as events, callbacks, and properties that make a good standard library GUI feasible.
See EI002.
The suggestion is to allow a class’s namespace to be opened so that one can define several members at once. The main utility would be to avoid tedious (and therefore error-prone) repetition of template parameters for template classes.
Paper by Carl Daniel: WG21/1420==J16/03-0002.
See ES006.
Discussion by Pete Becker. Early paperes: Matt Austern: N1400/02-0058. Pete becker: N1418/02-0076
As in C99, but consider overloading rules and literals.
???
Allow >> to terminate two specializations; e.g. vector< list< int>> vli;
Not being able to do this surprises and annoys novices, leads to harder to read code, and occationally catches even experts. It has also become the target of a popular jibe from GJ proponents.
Allow function objects to participate in overload resolution. For example
void f(int);
struct X {
void operator()(double);
};
X f;
f(1); // call the function
f(2.0); // call the object
Provide some way of collecting the overload set for a template argument and resolve it at the call point in the template.
Provide a way for the programmer to state that two pointers can be treated as referring to non-overlapping storage. “Like C99, but with precisely defined semantics”.
Provide a way of saying that a class cannot be derived from and/or that a virtual function cannot be overridden.
???
Provide Delphi/C# like properties. It may be possible to provide properties as a standard-library facility.
Allow operator.() to be defined.
Give more uniform treatment of built-in and user-defined types; arrays should not have an unfair syntactical advantage over vector and other standard-library containers.
See also Daniel Gutson's "Non Default Constructors for Arrays", ES037.
???
Allow operators that don't need to be members (e.g., -> [] ()) to be define at namespace scope.
That is enumerators that are not implicitly exported to the enclosing scope but must be qualified with their enumeration name to be accessed. For example:
enum E { a, b };
E x = a; // error: no ‘a’ in scope
E y = E::b; // ok
See ES030.
Provide enumerations with values that that don't implicitly convert to int. For example
explicit enum E { a, b };
int x = a; // error
"explicit enum" might imply scoped enumerators.
Note by David E. Miller: Improving Enumeration Types [N1513=03-0096]. Borrowing from C#.
Provide a way of saying that a function overrides an existing virtual function. Provide a way of saying that a function does not override an existing function.
Related proposal by Daniel Gutson: N1494.
Allow a finally clause for a try block.
Explicitly acknowledge that garbage collection is a valid implementation technique for C++ and define when destructors are called and what it means for a an object to be unreferenced. See TC++PL3 C.9.1.
Also, provide better support for enumerations used to express ranges. For example
enum Range { low=1.4, high=7.9 };
See also ES030 and ES050.
Daniel Gutson's paper.
Daniel Gutson's paper.
Daniel Gutson's paper.
Namespace aliasing issues (e.g., extending namespaces through namespace alias names). Note by Benjamin Kosnik: Namespace referencs. N1526.
For example:
bool f(string s)
{
switch(s) {
case "yes": return true;
case "no": return false;
default: throw Unexpected_string();
}
This is a frequent suggestion by novices. The frequency of requests has increased since the appearance of C#.
From one of the many people who emailed asking:
The basic idea is ???
???
Provide a preprocessor mechanism for limiting macros entering and exiting a scope. For example:
#nomacros #in A B … #out A X #endnomacros
No macros are expanded between #nomacros and #endnomacros unless explicitly enabled by #in. No macros defined between #nomacros and #endnomacros will be defined after #endnomacros unless explicitly enabled by #out.
Suggestion by Bjarne Stroustrup. After discussion in the EWG it was decided to look for a solution that allowed macros used by macros allowed in by “#in” to be used in the expansion of such macros only.
#nomacros should nest.
Paper by Anthony Williams: WG21/N1427-J16/03-0009. See EP006.
Systematically, synthesize fundamental operators, such as == and != for regular value types.
Suggestion by Alex Stepanov. Relates to EI002.
Statically check throw specifications and assume that extern "C" implies throw(). Suggestion by Sean Parent. Discussion on -ext. Or eliminate them.
Provide a mechanism that ensure that every operation used by a template is available (a constraint) or a facility that ensures that only a specific set of operations are used by a template (a concept). Suggestions by Matt Austern, Gabriel dos Reis, Alex Stepanov, Bjarne Stroustrup, and probably every serious generic programming practitioner.
A proposal should ideally
???
nullptr
Note by John Skaller:
The change
-----------
1. Remove the restriction that unions may
not contain members of a constructible type.
2. Add a restriction to those clauses which
define the semantics of generated default
constructors, copy constructors, copy assignment
operators, and destuctors to the effect that
a program is ill formed if there is a need
to generate one or more of these functions
for a union containing a constructible type.
[-----------
There is an existing situation where
a such a function is required and cannot be
generated, and that is when it must call
a function of a base class which is not accessible:
this feature is regularly exploited by programmers
to prevent objects being copied.
---------]
The motivation
---------------
In ISO C there is a univeral mechanism
for using the same storage extent to
hold different objects at different times,
namely the union. It is universal in the sense
that all data types may be put into unions.
There are two primary uses for unions.
(a) The first use is to save storage by reusing
some space which is no longer required.
In this use, the position in the code
determines which component of the union,
if any, is in use.
(b) The second use is to store data
describing one of several different cases,
in this use, a discriminant either within
the union, or some associated storage,
is used to determine dynamically which component
is in use.
The canonical example is the transacation,
which includes the messages sent by windowing systems.
Unions provide two important features:
(a) they guarrantee enough storage is reserved
for any one of the components
(b) they ensure that the storage is aligned
correctly for any one of the components
They also provide a convenient notation
to refer to the storage components.
Unions are not safe: the programmer may
inadvertantly access a component for which
a value has not been stored.
In C++, exactly the same motivations
for unions exists as in C. There is a need
to save space and to correctly align storage
to hold heterogenous data, whether the discriminant
is the program counter, an external variable,
or the first member of every component type.
However, in C++ there is an even stronger
motivation: in C we are not concerned
with execution of constructors and destructors.
In C++, use of an internal discriminant
allows automatic copying and destruction of the correct
union component.
The alternatives which most
programmers employ are serious design errors.
The first is to store all the alternatives in
a struct. The problem with this method is
not just that it wastes space, but that
all the values are initialised at one time,
and all destroyed at one time. If one of the
types does not admit a convenient default
constructor, it may even be impossible to use
this representation directly: instead a union
of pointer may be used, which is equivalent
to a proper union except that there is an extra
overhead referencing the components and
allocating heap storage.
I can't emphasise how endemic this design fault is:
it is used in text books. Here is a common example:
struct op {
char op_name;
op *left;
op *right;
};
This struct is used to represent an expression tree.
It is of course TOTALLY wrong. The correct representation is:
struct op;
struct unop { char op_name; op *arg; };
struct binop { char op_name; op *left; op *right; };
union opcase {
char id;
unop u;
binop b;
};
struct op {
enum {id_t, unop_t, binop_t} tag;
opcase n;
};
The reason is that: (1) it is not restricted
to arity 0,1 an 2 operators. (2) the case discriminant
is explicit (rather than relying on NULL pointer checks).
I note in passing that a C pointer or SQL data base type
is actually a discriminated union of pointer to object
or NULL, and, data value or NIL, respectively.
The second design error is
using an abstract base and a deirved
class for each alternative: it suffers
the same problem of allocation overhead
mentioned above, and almost invariably requires
a downcast to access the desired alternative.
At present then, C++ programmers can only use
the convenient, low overhead solution they desire
if the types involved are not constructible.
The change above removes that restriction,
and allows programmers to obtain correctly
sized and aligned storage which can be used
for any finite set of data types.
No code is broken by the proposal
since it is a relaxation of a restriction.
No safety is lost, even if constructible
types are used, since a union containing
constructible types requires a user defined
constructor, assignment operator, or destructor
to be used in contexts requiring construction,
assigment, or destruction.
My personal need here is two-fold.
First, I am generating C++ code
for a programming language which allows users
to specify a new primitive type by nominating a
C++ type.
This programming language needs to allocate storage
for these types in a block structured context,
which is the kind (a) of use mentioned above
where the program counter (position in the code)
determines what component of the union is used.
Indeed, it determines when to construct the
component, and when to destroy it. In this case
I need a naked union like:
union X {
string s;
vector v;
}
without any constructors or destructors, since
I will use placement new and expicit
destruction to build and destroy objects.
Since I'm emulating a stack frame, I'm happy
to prevent copying by leaving out copy and assignment
operators too.
Present workaround: I allocate the store as required
on the heap in some cases, and use a struct instead
of a union in others, costing time and storage, respectively.
In addition, there may be a problem failing to destroy
an object at the correct time in the second workaround.
The second use is the categorical sum, or discriminated
union, usage type (b). In this case I am emulating
ML style variants. This canonical ML example is the list:
type 'a list = Empty | Cons of int * 'a list
where 'a is a type variable. My representation is a tagged
pointer:
struct X { int caseno; void *p; }
where p is cast as appropriate. Unfortunately,
apart from costing allocations, there is a serious
semantic problem, since copying these pointers
does not copy the objects pointed at by p.
This second use is a very common need: i cited
before the example of transation types,
which are all so often *incorrectly* encoded
using a base and derived types. That encoding
is popular partly due to ignorance of correct
structure, but also because it is relatively simple
to use RTTI to determine the case.
[The technique suffers from both allocation costs
and lack of type closure over the union type,
quite apart from confusing programs by adding
yet another abuse of inheritance]
See EP011.
Note by Dave Abrahams:
As a separate related matter, I think we ought to be thinking about
removing the use of copy-initialization for forms not involving curly
braces. Among other things, that would allow:
auto_ptr< T> x = new T;
instead of the currently-required:
auto_ptr< T> x = auto_ptr< T>(new T);
(due to auto_ptr's explicit constructor). I know it says "explicit",
but that's really there to prevent unintended conversions. The
declaration above is highly intentional in either form, and probably
clearer in the first form!
This is also useful for cases like:
struct Y
{
Y();
explicit Y(int);
};
struct X
{
explicit X(Y);
};
int z = 3;
X x(Y(z)); // oops, declares a function
X& xx = x; // error
allowing
X x = Y(Z);
instead of the awkward:
X x((Y(Z)));
[I know it doesn't generalize to multiple arguments]
Also, I note that at least one important compiler front-end does
copy-elision for the copy-initialization case but NOT for the
direct-initialization case, which is awfully unintuitive. Why should
users have to worry about the fact that one form might be more
efficient than the other, at the whim of the compiler vendor?
Provide the ability to do a dynamic lookup on more than one operand. Frequest suggestion. Discussion in D&E.
Documents from Julian Smith: N1463=03-0046 and N1529=03-0112.
enum E : char { /* ... */ };
enum N : int { /* ... */ }
enum B { a, b };
enum D : B { c, d }; // members of D are a, b, c, and d
See also ES050 and ES030.
Note that this violates most ideas of proper use of inheritance. Only by knowing D can you use c and d, yet there must be uses of B around: this leads to slicing.
???
John Skaller on reflectors. In addition, several C99 features and C99-like features are proposed individually. Examples: most C99 libraries, all C99 preprocessor features, __function__ (???), initializer lists (???).
Find a general way of supplying values for types that can be compile-time initialized. For example:
string s = String"Hello"; Complex z = Complex"0,PI";This may involve defining special "literal constructors" that define a direct mapping of values to members.
Define a type that can hold any pointer to member in a way similar to the way void* can hold any pointer. For example:
struct A {
int a;
int* p;
};
struct B {
int a;
int* p;
};
int A::* pm1 = &A::a; // pointer to int member of A
int* A::* pm2 = &A::p; // pointer to int* member of A
void A::* gp1 = pm1; // generic pointer to member of A
gp2 = pm2;
pm2 = gp2; // error no uncast assignment from generic pointer to specific pointer
pm2 = static_cast(gp2);
void *::* gp2 = &A::a; // generic pointer to member of any class
gp2 = &B::a;
Is there sufficint need for a notion of "generic pointer to member of A"?
Is there sufficint need for a notion of "generic pointer to member of any class'?
Is there an acceptable syntax?
Does these notions fit into common implementation schemes?
???
???
"Like the ones in Borland C++"
Allow arrays of references.
Provide a mechanism to declaring the byte order of members of a struct
Provide an alignof operator. GNU version described in c++std-ext-4274. VC++ version described in c++std-ext-4276.
Note by Atila Fehler.
Allow a member function to be invoked using the free-standing function syntax. For example
class X {
public:
void f(int);
};
void f(int,int);
void g(X x, X* p)
{
f(1,2); // call global function
f(x,1); // call x.f(1)
f(1,x); // error
f(p,1); // call p->f(1)
}
This would make the writing of generic (template) code simpler by saving the template writer from having to distinguish between the two kinds of functions.
Provide a way of providing code to be provided as arguments without having to define a separate named function.
Allow a virtual function to be declared final; that is, to allow no further overriding. This facility is often discussed together with a use of final for a class to prevent further derivation.
For example, "intrinsic functions" such as is_pod(), has_dot(), and has_arrow().
For example, locks, threading, memory barrier, static local initialization. See OpenMP: www.openwp.org.
Define default arguments as syntactic sugar for overloading. This would simplify the language, make pointers to functions work better, and eliminate "special pleading" language in the standard library specification.
In other words, somehow combine a using directive with an #include. For example:
usingor; // bring in the declarations from header "vector"
using vector; // find "vector" and bring it inThis should probably be done with some protection against changes of the semantics of "vector" because of macros, etc.
A kind of typedef that introduces a real type. For example:
real typedef int A; real typedef int B; A a, a2; B b; a = b; // error a = a2; // ok a = a+b; // ??? a = a+a2; // ???There has bee explicit requests for such a mechanism for user defined types, possibly a way of deriving a class that requires an explicit cast to convert to its base.
???
enum errFoo {
errOK,
errFailed
};
enum errBoo : errFoo {
errUnknown
};
Suggestion by Petar Shomov, and others.
As in C99. ???
Daniel Gutson. N1492.
Allow a nested namespace be re-opened with the syntax
namespace N:M { ... }
Note by Jon Jagger. N1524.
Allow
friend T;where T is a template argument or typedef name.
Note by Mike Miller. N1520.
Note by Gabriel Dos Reis: Generailized constant expressions. N1521.
I suspect this idea relates to the general common wish for more operators (to overload).
Stephan T. Lavavej: "I encountered my problem while writing code to serialize and deserialize
data structures. Overloading worked fine for the serialization functions
since they took as parameters the objects to be serialized. But the
deserialization functions all took exactly one argument, a deque
This may and may not affect the way initializers and string literals are handled.
See Kevlin Henney: http://www.cuj.com/documents/s=7995/cujcexp1905henney/
If not, it is a pure library issue.
This may and may not affect the way initializers and string literals are handled, and it may require some other direct language support. If not, it is a pure library issue.
This has been proposed under many names - often the popular, descriptive, but ugly "Bignum".
To match explicit constructors.
To allow parameterized constants, such as pi
ES081. A const string class
ES082. An infinite precision integer class
ES083. Explicit operator conversion functions
class Color {
public:
explicit Color(int);
explicit operator int();
// ...
};
Color col = 7; // error
Color col(7); // ok
Color col = Color(7); // ok
int i = col; // error
int i(col); // ok (explicit enough?)
int i = int(col); // ok
ES084. Object templates