Aggregate initialization - cppreference.com (original) (raw)

Initializes an aggregate from an initializer list. It is a form of list-initialization(since C++11).

Contents

• 1 Syntax
• 2 Definitions
  • 2.1 Aggregate
  • 2.2 Element
  • 2.3 Appertainment
• 3 Initialization process
  • 3.1 Determining element kind
  • 3.2 Explicitly initialized elements
  • 3.3 Implicitly initialized elements
• 4 Arrays with unknown bounds
• 5 Designated initializers
• 6 Character arrays
• 7 Notes
• 8 Example
• 9 Defect reports
• 10 See also

[edit] Syntax

1,2) Initializing an aggregate with an ordinary initializer list.

3,4) Initializing an aggregate with designated initializers (aggregate class only).

[edit] Definitions

[edit] Aggregate

An aggregate is one of the following types:

• array types
• class types that has

• no private or protected direct non-static data members

• no virtual member functions

[edit] Element

The elements of an aggregate are:

• for an array, the array elements in increasing subscript order, or

[edit] Appertainment

Each initializer clause in a brace-enclosed initializer list is said to appertain to an element of the aggregate being initialized or to an element of one of its subaggregates.

Considering the sequence of initializer clauses, and the sequence of aggregate elements initially formed as the sequence of elements of the aggregate being initialized and potentially modified as described below:

• For each initializer clause, if any of the following conditions is satisfied, it appertains to the corresponding aggregate element elem:

• elem is not an aggregate.

• The initializer clause begins with {.

• The initializer clause is an expression, and an implicit conversion sequence can be formed that converts the expression to the type of elem.

• elem is an aggregate that itself has no aggregate elements.

• Otherwise, elem is an aggregate and that subaggregate is replaced in the list of aggregate elements by the sequence of its own aggregate elements, and the appertainment analysis resumes with the first such element and the same initializer clause. In other words, these rules apply recursively to the aggregate’s subaggregates.

The analysis is complete when all initializer clauses have been exhausted. If any initializer clause remains that does not appertain to an element of the aggregate or one of its subaggregates, the program is ill-formed.

struct S1 { long a, b; }; struct S2 { S1 s, t; };   // Each subaggregate of “x” is appertained to an initializer clause starting with { S2 x[2] = { // appertains to “x[0]” { {1L, 2L}, // appertains to “x[0].s” {3L, 4L} // appertains to “x[0].t” }, // appertains to “x[1]” { {5L, 6L}, // appertains to “x[1].s” {7L, 8L} // appertains to “x[1].t” } };   // “x” and “y” have the same value (see below) S2 y[2] = {1L, 2L, 3L, 4L, 5L, 6L, 7L, 8L};   // The process of the appertainment analysis of “y”: // 1. Initializes the aggregate element sequence (x[0], x[1]) and // the initializer clause sequence (1L, 2L, 3L, 4L, 5L, 6L, 7L, 8L). // 2. Starting from the first elements of each sequence, // checks whether 1L appertains to x[0]: // · x[0] is an aggregate. // · 1L does not begin with {. // · 1L is an expression, but it cannot be implicitly converted to S2. // · x[0] has aggregate elements. // 3. 1L cannot appertain to x[0], therefore x[0] is replaced by x[0].s and x[0].t, // the aggregate element sequence becomes (x[0].s, x[0].t, x[1]). // 4. Resumes the appertainment check, but 1L cannot appertain to x[0].s either. // 5. The aggregate element sequence now becomes (x[0].s.a, x[0].s.b, x[0].t, x[1]). // 6. Resumes the appertainment check again: // 1L appertains to x[0].s.a, and 2L appertains to x[0].s.b. // 7. The rest of the appertainment analysis works similarly.   char cv[4] = {'a', 's', 'd', 'f', 0}; // Error: too many initializer clauses

[edit] Initialization process

[edit] Determining element kind

The effects of aggregate initialization are:

1. Determine the explicitly initialized elements of the aggregate as follows:

• Otherwise, if the initializer list is non-empty, the explicitly initialized elements of the aggregate are the elements with an appertained initializer clause and the elements having a subaggregate with an appertained initializer clause.
• Otherwise, the initializer list must be empty ({}), and there are no explicitly initialized elements.

The program is ill-formed if the aggregate is a union and there are two or more explicitly initialized elements:

union u { int a; const char* b; };   u a = {1}; // OK: explicitly initializes member a u b = {0, "asdf"}; // error: explicitly initializes two members u c = {"asdf"}; // error: int cannot be initialized by "asdf"   // C++20 designated initializer lists u d = {.b = "asdf"}; // OK: can explicitly initialize a non-initial member u e = {.a = 1, .b = "asdf"}; // error: explicitly initializes two members

1. Initialize each element of the aggregate in the element order. That is, all value computations and side effects associated with a given element are sequenced before those of any element that follows it in order(since C++11).

[edit] Explicitly initialized elements

For each explicitly initialized element:

• If an initializer clause appertains to the aggregate element, then the aggregate element is copy-initialized from the initializer clause.
• Otherwise, the aggregate element is copy-initialized from a brace-enclosed initializer list consisting of all of the initializer clauses that appertain to subobjects of the aggregate element, in the order of appearance.

struct A { int x;   struct B { int i; int j; } b; } a = {1, {2, 3}}; // initializes a.x with 1, a.b.i with 2, a.b.j with 3   struct base1 { int b1, b2 = 42; };   struct base2 { base2() { b3 = 42; }   int b3; };   struct derived : base1, base2 { int d; };   derived d1{{1, 2}, {}, 4}; // initializes d1.b1 with 1, d1.b2 with 2, // d1.b3 with 42, d1.d with 4 derived d2{{}, {}, 4}; // initializes d2.b1 with 0, d2.b2 with 42, // d2.b3 with 42, d2.d with 4

[edit] Implicitly initialized elements

For a non-union aggregate, each element that is not an explicitly initialized element is initialized as follows:

• Otherwise, if the element is not a reference, the element is copy-initialized from an empty initializer list.
• Otherwise, the program is ill-formed.

struct S { int a; const char* b; int c; int d = b[a]; };   // initializes ss.a with 1, // ss.b with "asdf", // ss.c with the value of an expression of the form int{} (that is, 0), // and ss.d with the value of ss.b[ss.a] (that is, 's') S ss = {1, "asdf"};

If the aggregate is a union and the initializer list is empty, then

• Otherwise, the first member of the union (if any) is copy-initialized from an empty initializer list.

[edit] Arrays with unknown bounds

The number of elements in an array of unknown bound initialized with a brace-enclosed initializer list is the number of explicitly initialized elements of the array. An array of unknown bound cannot be initialized with {}.

int x[] = {1, 3, 5}; // x has 3 elements   struct Y { int i, j, k; };   Y y[] = {1, 2, 3, 4, 5, 6}; // y has only 2 elements: // 1, 2 and 3 appertain to y[0], // 4, 5 and 6 appertain to y[1]   int z[] = {} // Error: cannot declare an array without any element

[edit] Character arrays

Arrays of ordinary character types (char, signed char, unsigned char), char8_t(since C++20), char16_t, char32_t(since C++11), or wchar_t can be initialized from ordinary string literals, UTF-8 string literals(since C++20), UTF-16 string literals, UTF-32 string literals(since C++11), or wide string literals, respectively, optionally enclosed in braces. Additionally, an array of char or unsigned char may be initialized by a UTF-8 string literal, optionally enclosed in braces(since C++20). Successive characters of the string literal (which includes the implicit terminating null character) initialize the elements of the array, with an integral conversion if necessary for the source and destination value(since C++20). If the size of the array is specified and it is larger than the number of characters in the string literal, the remaining characters are zero-initialized.

char a[] = "abc"; // equivalent to char a[4] = {'a', 'b', 'c', '\0'};   // unsigned char b[3] = "abc"; // Error: initializer string too long unsigned char b[5]{"abc"}; // equivalent to unsigned char b[5] = {'a', 'b', 'c', '\0', '\0'};   wchar_t c[] = {L"кошка"}; // optional braces // equivalent to wchar_t c[6] = {L'к', L'о', L'ш', L'к', L'а', L'\0'};

[edit] Notes

An aggregate class or array may include non-aggregate public bases(since C++17), members, or elements, which are initialized as described above (e.g. copy-initialization from the corresponding initializer clause).

Until C++11, narrowing conversions were permitted in aggregate initialization, but they are no longer allowed.

Until C++11, aggregate initialization could only be used in variable definition, and could not be used in a constructor initializer list, a new-expression, or temporary object creation due to syntax restrictions.

In C, character array of size one less than the size of the string literal may be initialized from a string literal; the resulting array is not null-terminated. This is not allowed in C++.

[edit] Example

#include #include #include   struct S { int x;   struct Foo { int i; int j; int a[3]; } b; };   int main() { S s1 = {1, {2, 3, {4, 5, 6}}}; S s2 = {1, 2, 3, 4, 5, 6}; // same, but with brace elision S s3{1, {2, 3, {4, 5, 6}}}; // same, using direct-list-initialization syntax S s4{1, 2, 3, 4, 5, 6}; // error until CWG 1270: // brace elision only allowed with equals sign   int ar[] = {1, 2, 3}; // ar is int[3] // char cr[3] = {'a', 'b', 'c', 'd'}; // too many initializer clauses char cr[3] = {'a'}; // array initialized as {'a', '\0', '\0'}   int ar2d1[2][2] = {{1, 2}, {3, 4}}; // fully-braced 2D array: {1, 2} // {3, 4} int ar2d2[2][2] = {1, 2, 3, 4}; // brace elision: {1, 2} // {3, 4} int ar2d3[2][2] = {{1}, {2}}; // only first column: {1, 0} // {2, 0}   std::array<int, 3> std_ar2{{1, 2, 3}}; // std::array is an aggregate std::array<int, 3> std_ar1 = {1, 2, 3}; // brace-elision okay   // int ai[] = {1, 2.0}; // narrowing conversion from double to int: // error in C++11, okay in C++03   std::string ars[] = {std::string("one"), // copy-initialization "two", // conversion, then copy-initialization {'t', 'h', 'r', 'e', 'e'}}; // list-initialization union U { int a; const char* b; }; U u1 = {1}; // OK, first member of the union // U u2 = {0, "asdf"}; // error: too many initializers for union // U u3 = {"asdf"}; // error: invalid conversion to int   { std::puts("Garbage collecting unused variables... Done."); } ( s1, s2, s3, s4, ar, cr, ar2d1, ar2d2, ar2d3, std_ar2, std_ar1, u1 ); }   // aggregate struct base1 { int b1, b2 = 42; };   // non-aggregate struct base2 { base2() : b3(42) {}   int b3; };   // aggregate in C++17 struct derived : base1, base2 { int d; };   derived d1{{1, 2}, {}, 4}; // d1.b1 = 1, d1.b2 = 2, d1.b3 = 42, d1.d = 4 derived d2{{}, {}, 4}; // d2.b1 = 0, d2.b2 = 42, d2.b3 = 42, d2.d = 4

Output:

Garbage collecting unused variables... Done.

[edit] Defect reports

The following behavior-changing defect reports were applied retroactively to previously published C++ standards.

[edit] See also

• copy elision
• initialization
  • constant initialization
  • list initialization
  • reference initialization
  • value initialization
  • zero initialization