First part :
std::initializer_list
is a really helpful feature of C++11, so I wondered how it is implemented in the standard library. From what I read here, the compiler creates an array of type T
and gives the pointer to the initializer_list<T>
.
It also states that copying an initializer_list
will create a new object referencing the same data : why is it so ? I would have guessed that it either :
- copies the data for the new
initializer_list
- moves ownership of the data to the new
initializer_list
Second part :
From just one of many online references for the std::vector
constructors:
vector (initializer_list<value_type> il,
const allocator_type& alloc = allocator_type());
(6) initializer list constructor
Constructs a container with a copy of each of the elements in il, in the same order.
I am not comfortable with move semantics yet, but couldn't the data of il
be moved to the vector
? I am not aware of the deep implementation of std::vector
but IIRC it uses plain-old arrays.
Most likely, just a pair of pointers, or a pointer and a size. Paragraph 18.9/2 of the C++11 Standard even mentions this in a (non-normative) note:
Moreover:
No, you can't move from the elements of an
initializer_list
, since elements of aninitializer_list
are supposed to be immutable (see the first sentence of the paragraph quoted above). That's also the reason why onlyconst
-qualified member functions give you access to the elements.